Adding Efficient Solution Problem - 977 - Squares Sorted Array

Author: Vanditg

Squares_Sorted_Array/EfficientSolution.py

@@ -0,0 +1,25 @@
+##==================================
+## Leetcode
+## Student: Vandit Jyotindra Gajjar
+## Year: 2020
+## Problem: 977
+## Problem Name: Squares of a Sorted Array  
+##===================================
+#
+#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.
+#
+#Example 1:
+#
+#Input: [-4,-1,0,3,10]
+#Output: [0,1,9,16,100]
+#Example 2:
+#
+#Input: [-7,-3,2,3,11]
+#Output: [4,9,9,49,121]
+class Solution:
+    def sortedSquares(self, A):
+        for i in range(len(A)):	#Loop through A 
+            A[i] = A[i]*A[i]	#Update the list by taking elements square
+        A.sort()	#Sort the A list
+        return A	#We return A