coding-Interview/SquaresSortedArray.java at master · arjunmullick/coding-Interview · GitHub

27 lines (24 loc) · 727 Bytes

package com.leetcode;

public class SquaresSortedArray {

//https://leetcode.com/problems/squares-of-a-sorted-array/

class Solution {

public int[] sortedSquares(int[] nums) {

int n = nums.length;

int result[] = new int[n];

int l = 0;

int r = n-1;

int counter = n-1;

while(l<=r && counter >=0){

if(Math.abs(nums[l])>Math.abs(nums[r])){

result[counter] = nums[l]*nums[l];

l++;

}else{

result[counter] = nums[r]*nums[r];

r--;

}

counter--;

}

return result;

}

Expand file tree