GoLang Solution For LeetCode Problem: Squares of a Sorted Array
Solving Squares of a Sorted Array in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.
Input: [-4,-1,0,3,10] Output: [0,1,9,16,100]
Input: [-7,-3,2,3,11] Output: [4,9,9,49,121]
- 1 <= A.length <= 10000
- -10000 <= A[i] <= 10000
- A is sorted in non-decreasing order.
See the full details of the problem Squares of a Sorted Array at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go