update solutions

Author: DSXiangLi

数组/48. 旋转图像.md

@@ -83,12 +83,15 @@ class Solution:
         """
         Do not return anything, modify matrix in-place instead.
         """
-        n=len(matrix)
-        for i in range(n//2):
-            for j in range(n):
-                matrix[i][j] ,matrix[n-1-i][j]= matrix[n-1-i][j], matrix[i][j]
-        for i in range(n):
+        nrow = len(matrix)
+        for i in range(nrow//2):
+            matrix[i][:],matrix[nrow-1-i][:] = matrix[nrow-1-i][:], matrix[i][:]
+        for i in range(nrow):
             for j in range(i):
                 matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
-```
+        return matrix
+
+
+
+
 

数组/495. 提莫攻击.md

@@ -33,15 +33,12 @@
 ```python
 class Solution:
     def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
-        harm = duration
-        pos = timeSeries[0]+duration
-        for i in timeSeries[1:]:
-            if pos>i:
-                harm += i+duration-pos 
-            else:
-                harm+=duration
-            pos = i+duration
-        return harm
+        total = 0
+        pre = 0
+        for i in range(len(timeSeries)):
+            total += max(duration - max(pre-timeSeries[i],0),0)
+            pre = timeSeries[i]+duration
+        return total
 ```
 
 Tips

数组总结.md

@@ -787,13 +787,13 @@ class Solution:
         """
         Do not return anything, modify matrix in-place instead.
         """
-        n=len(matrix)
-        for i in range(n//2):
-            for j in range(n):
-                matrix[i][j] ,matrix[n-1-i][j]= matrix[n-1-i][j], matrix[i][j]
-        for i in range(n):
+        nrow = len(matrix)
+        for i in range(nrow//2):
+            matrix[i][:],matrix[nrow-1-i][:] = matrix[nrow-1-i][:], matrix[i][:]
+        for i in range(nrow):
             for j in range(i):
                 matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
+        return matrix
 ```
 
 
@@ -928,15 +928,12 @@ Tips
 ```python
 class Solution:
     def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
-        harm = duration
-        pos = timeSeries[0]+duration
-        for i in timeSeries[1:]:
-            if pos>i:
-                harm += i+duration-pos 
-            else:
-                harm+=duration
-            pos = i+duration
-        return harm
+        total = 0
+        pre = 0
+        for i in range(len(timeSeries)):
+            total += max(duration - max(pre-timeSeries[i],0),0)
+            pre = timeSeries[i]+duration
+        return total
 ```
 
 Tips