推 Smallsh: 大師 07/25 13:16
推 sustainer123: 我也想quick 07/25 13:24
→ NCKUEECS: 我也是每次寫每次錯:( 07/25 13:47
推 rainkaras: 大師 07/25 13:55
推 oin1104: 大師 07/25 14:24
推 dont: 大師 07/25 19:32
肥肥想說來練一下quick
然後怎麼搞都過不了worst case
直接水桶伺候 操
後來想想我最該練的應該是merge sort
沒寫過幾次
def sortArray(self, nums: List[int]) -> List[int]:
cnt = [0 for _ in range(100002)]
for n in nums:
cnt[n+50000] += 1
ans = []
for idx, val in enumerate(cnt):
for i in range(val):
ans.append(idx-50000)
return ans
# def middle_of_threerandom(l, r):
# pivot_index_0 = random.randint(l, r)
# pivot_index_1 = random.randint(l, r)
# pivot_index_2 = random.randint(l, r)
# tmp = sorted([(nums[pivot_index_0], pivot_index_0),
(nums[pivot_index_1], pivot_index_1), (nums[pivot_index_2], pivot_index_2)])
# return tmp[1][1]
# def qs(l,r):
# if l >= r:
# return
# pivot_idx = middle_of_threerandom(l,r)
# nums[r], nums[pivot_idx] = nums[pivot_idx], nums[r]
# pivot = nums[r]
# start = l
# for i in range(l, r):
# if nums[i] <= pivot:
# nums[start], nums[i] = nums[i], nums[start]
# start += 1
# nums[r], nums[start] = nums[start], nums[r]
# qs(l, start-1)
# qs(start+1, r)
# qs(0, len(nums)-1)
# return nums
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 125.229.37.69 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1721884569.A.3A0.html
※ 編輯: DJYOMIYAHINA (125.229.37.69 臺灣), 07/25/2024 13:16:21