Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 5489307

Browse files
committed
add 215
1 parent a2ab472 commit 5489307

File tree

3 files changed

+128
-0
lines changed

3 files changed

+128
-0
lines changed

‎LeetCodeSolutions/004.py‎

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
#==================================================
2+
#==> Title: 4. 寻找两个正序数组的中位数
3+
#==> Author: Zhang zhen
4+
#==> Email: hustmatnoble.gmail.com
5+
#==> GitHub: https://github.com/MatNoble
6+
#==> Date: 2/13/2021
7+
#==================================================
8+
9+
"""
10+
https://leetcode-cn.com/problems/median-of-two-sorted-arrays/
11+
"""
12+
13+
from typing import List
14+
class Solution:
15+
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
16+
m, n = len(nums1), len(nums2)
17+
i = j = 0
18+
nums = []
19+
while i < m and j < n:
20+
if nums1[i] <= nums2[j]:
21+
nums.append(nums1[i])
22+
i += 1
23+
else:
24+
nums.append(nums2[j])
25+
j += 1
26+
nums += nums1[i:]
27+
nums += nums2[j:]
28+
i, j = 0, len(nums)-1
29+
mid = j // 2
30+
if j & 1:
31+
return (nums[mid] + nums[mid+1]) / 2
32+
else:
33+
return nums[mid]
34+
35+
mat = Solution()
36+
nums1 = [1, 2, 9]
37+
nums2 = [3, 4, 5, 6]
38+
mat.findMedianSortedArrays(nums1, nums2)

‎LeetCodeSolutions/215.py‎

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
#==================================================
2+
#==> Title: 215. 数组中的第K个最大元素
3+
#==> Author: Zhang zhen
4+
#==> Email: hustmatnoble.gmail.com
5+
#==> GitHub: https://github.com/MatNoble
6+
#==> Date: 2/13/2021
7+
#==================================================
8+
9+
"""
10+
https://leetcode-cn.com/problems/kth-largest-element-in-an-array/
11+
"""
12+
13+
from typing import List
14+
class Solution:
15+
def findKthLargest(self, nums: List[int], k: int) -> int:
16+
self.k = len(nums) - k
17+
def partition(array, left, right):
18+
# 随机选取 pivot, 并交换至 right
19+
idx = random.randint(left, right)
20+
array[idx], array[right] = array[right], array[idx]
21+
pivot = array[right]
22+
i, j= left, right - 1
23+
while True:
24+
while i < right and array[i] <= pivot: i += 1
25+
while j >= left and array[j] > pivot: j -= 1
26+
if i > j: break
27+
array[i], array[j] = array[j], array[i]
28+
array[right], array[i] = array[i], array[right]
29+
return i
30+
def quickQort(array, left, right):
31+
if left >= right: return
32+
## 前序遍历
33+
index = partition(array, left, right)
34+
if self.k == index:
35+
return
36+
elif self.k < index:
37+
quickQort(array, left, index-1)
38+
else:
39+
quickQort(array, index+1, right)
40+
quickQort(nums, 0, len(nums)-1)
41+
return nums[self.k]
42+
43+
mat = Solution()
44+
nums = [3,2,1,5,6,4]
45+
k = 3
46+
mat.findKthLargest(nums, k)

‎LeetCodeSolutions/interview1714.py‎

Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
#==================================================
2+
#==> Title:
3+
#==> Author: Zhang zhen
4+
#==> Email: hustmatnoble.gmail.com
5+
#==> GitHub: https://github.com/MatNoble
6+
#==> Date:
7+
#==================================================
8+
9+
import random
10+
from typing import List
11+
class Solution:
12+
def smallestK(self, arr: List[int], k: int) -> List[int]:
13+
self.k = k
14+
def partition(array, left, right):
15+
# 随机选取 pivot, 并交换至 right
16+
idx = random.randint(left, right)
17+
array[idx], array[right] = array[right], array[idx]
18+
pivot = array[right]
19+
i, j= left, right - 1
20+
while True:
21+
while i < right and array[i] <= pivot: i += 1
22+
while j >= left and array[j] > pivot: j -= 1
23+
if i > j: break
24+
array[i], array[j] = array[j], array[i]
25+
array[right], array[i] = array[i], array[right]
26+
return i
27+
def quickQort(array, left, right):
28+
if left >= right: return
29+
## 前序遍历
30+
index = partition(array, left, right)
31+
print(index, array)
32+
if self.k == index:
33+
return
34+
elif self.k < index:
35+
quickQort(array, left, index-1)
36+
else:
37+
quickQort(array, index+1, right)
38+
quickQort(arr, 0, len(arr)-1)
39+
return arr[:k]
40+
41+
mat = Solution()
42+
arr = [1,3,5,7,2,4,6,8]
43+
k = 2
44+
mat.smallestK(arr, k)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /