From 722a32cd2a1a89b3790ac824afe2cffda643965a Mon Sep 17 00:00:00 2001
From: JaneyLin <105125897+janeyziqinglin@users.noreply.github.com>
Date: Mon, 6 Jun 2022 22:11:16 -0500
Subject: [PATCH] =?UTF-8?q?Update=200977.=E6=9C=89=E5=BA=8F=E6=95=B0?=
 =?UTF-8?q?=E7=BB=84=E7=9A=84=E5=B9=B3=E6=96=B9.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

python3 version of brutal force
---
 problems/0977.有序数组的平方.md | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/problems/0977.有序数组的平方.md b/problems/0977.有序数组的平方.md
index 0e79a3d6..d3da662f 100644
--- a/problems/0977.有序数组的平方.md
+++ b/problems/0977.有序数组的平方.md
@@ -39,6 +39,15 @@ public:
     }
 };
 ```
+```python3
+class Solution:
+    def sortedSquares(self, nums: List[int]) -> List[int]:
+        res=[]
+        for num in nums: 
+            res.append(num**2)
+        return sorted(res)   
+```	
+        
 
 这个时间复杂度是 O(n + nlogn)， 可以说是O(nlogn)的时间复杂度，但为了和下面双指针法算法时间复杂度有鲜明对比，我记为 O(n + nlog n)。