[LeetCode 378. Kth Smallest Element in a Sorted Matrix ] Stack Easy (19주차 9/10, 23/150)
Algorithm/LeetCode 문제 풀이 2019. 5. 12. 12:42이렇게 풀면 엄청 느릴 것 같지만...
class Solution:
def kthSmallest(self, matrix: List[List[int]], k: int) -> int:
data = []
for i in range(len(matrix[0])):
for j in range(len(matrix)):
data.append(matrix[i][j])
data.sort()
return data[k-1]
'Algorithm > LeetCode 문제 풀이' 카테고리의 다른 글
| [LeetCode 74. Search a 2D Matrix] 2/5 25/150 (0) | 2019.05.16 |
|---|---|
| [LeetCode 69. Sqrt(x)] Easy, Binary Search 1/5 24/150 (0) | 2019.05.15 |
| [LeetCode 155. Min Stack ] Stack Easy (19주차 8/10, 22/150) (0) | 2019.05.12 |
| [LeetCode 20. Valid Parentheses ] Easy (19주차 7/10, 21/150) (0) | 2019.05.12 |
| [LeetCode 14. Longest Common Prefix ] Easy (19주차 6/10, 20/150) (0) | 2019.05.12 |
