[Leetcode] Squares of a Sorted Array (Explore Arrays 101) / 릿코드 활용, 코딩테스트

1. 문제설명

Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

 

Example 1:

Input: nums = [-4,-1,0,3,10] Output: [0,1,9,16,100] Explanation: After squaring, the array becomes [16,1,0,9,100]. After sorting, it becomes [0,1,9,16,100].

Example 2:

Input: nums = [-7,-3,2,3,11] Output: [4,9,9,49,121]

 

Constraints:

• 1 <= nums.length <= 104
• -104 <= nums[i] <= 104
• nums is sorted in non-decreasing order.

2. 내 풀이

class Solution {
public:
    vector<int> sortedSquares(vector<int>& nums) {
        vector<int> numArray;
        int tempNum = 0;
        int vecSize = nums.size();
        
        for (int i = 0; i < nums.size(); i++) {
            numArray.push_back(pow(nums[i], 2));
        }
        
        sort(numArray.begin(), numArray.end());
        
        //for (int i = 0; i < numArray.size()-1; i++) {
        //    for(int j = i+1; j < numArray.size(); j++) {
        //        if(numArray[i] > numArray[j]) {
        //            tempNum = numArray[i];
        //            numArray[i] = numArray[j];
         //           numArray[j] = tempNum; 
        //        }
        //    }
        //}
        
        return numArray;
    } 
};