977. Squares of a Sorted Array

class Solution {
    public int[] sortedSquares(int[] nums) {
        int[] result = new int[nums.length];
        int resultIndex = 0;
        int smallestIndex = 0;
        int smallestNumber = 0;
        int leftIndex = 0;
        int rightIndex = 0;

        for (int i = 0; i < nums.length; i++) {
            nums[i] = square(nums[i]);
            if (i == 0) {
                smallestIndex = i;
                smallestNumber = nums[i];
            } else {
                if (nums[i] < smallestNumber) {
                    smallestIndex = i;
                    smallestNumber = nums[i];
                }
            }
        }

        result[resultIndex] = smallestNumber;
        leftIndex = smallestIndex - 1;
        rightIndex = smallestIndex + 1;
        resultIndex++;

        while(resultIndex < result.length) {
            if (leftIndex < 0) {
                //left 먼저 소진
                result[resultIndex] = nums[rightIndex];
                rightIndex++;
            } else if (rightIndex >= nums.length) {
                //right 먼저 소진
                result[resultIndex] = nums[leftIndex];
                leftIndex--;
            } else {
                int leftSquare = nums[leftIndex];
                int rightSquare = nums[rightIndex];

                if (leftSquare <= rightSquare) {
                    result[resultIndex] = leftSquare;
                    leftIndex--;
                } else {
                    result[resultIndex] = rightSquare;
                    rightIndex++;
                }
            }

            resultIndex++;
        }
        return result;
    }

    public int square(int number) {
        return number * number;
    }
}