Merge pull request vJechsmayr#177 from divyhshah/master

Solution to 0054 Spiral Matrix

Author: vJechsmayr

LeetCode/0042_Trapping_Rain_Water.py

@@ -0,0 +1,24 @@
+class Solution:
+ def trap(self, height: List[int]) -> int:
+ n = len(height)
+ if n>0:
+ left = [0]*n 
+ right = [0]*n 
+ result = 0
+
+ # Fill left array 
+ left[0] = height[0] 
+ for i in range( 1, n): 
+ left[i] = max(left[i-1], height[i]) 
+
+ # Fill right array 
+ right[n-1] = height[n-1] 
+ for i in range(n-2, -1, -1): 
+ right[i] = max(right[i + 1], height[i]); 
+
+ for i in range(0, n): 
+ result += min(left[i], right[i]) - height[i] 
+
+ return result
+ else:
+ return 0

LeetCode/0054_Spiral_Matrix.py

@@ -0,0 +1,35 @@
+class Solution:
+ def spiralOrder(self, matrix):
+ if len(matrix)>0:
+ k, l = 0, 0
+ m = len(matrix)
+ n = len(matrix[0])
+
+ l1 = []
+ while (k < m and l < n):
+
+ for i in range(l, n):
+ l1.append(matrix[k][i])
+
+ k += 1
+
+ for i in range(k, m):
+ l1.append(matrix[i][n - 1])
+ n -= 1
+
+ if (k < m):
+
+ for i in range(n - 1, (l - 1), -1):
+ l1.append(matrix[m - 1][i])
+
+ m -= 1
+
+ if (l < n):
+ for i in range(m - 1, k - 1, -1):
+ l1.append(matrix[i][l])
+
+ l += 1
+ return l1
+
+
+