dangdangA

 1 def parttion(nums,left,right):
 2     # 基準(zhǔn)值
 3     p = nums[left]
 4     low, high = left, right
 5     while low < high:
 6         while (low < high) and (nums[high] >= p):
 7             high -= 1
 8         nums[low], nums[high] = nums[high], nums[low]
 9         while (low < high) and (nums[low] <= p):
10             low += 1
11         nums[low], nums[high] = nums[high], nums[low]
12 
13     return low
14 
15 def quickSort(nums,left,right):
16     #找見基準(zhǔn)值的下標(biāo),也就是循環(huán)遍歷匯合的地方
17     if left < right:
18         p = parttion(nums,left,right)
19         quickSort(nums,left,p-1)
20         quickSort(nums,p+1,right)
21     return nums
22 
23 def sortedSet(nums):
24     #首先快速排序
25     #其次去重(雙指針)
26     nums = quickSort(nums,0,len(nums) - 1)
27     setNum = [nums[0]]
28     i, j = 0, 1
29     while j <= (len(nums) - 1):
30         if nums[i] != nums[j]:
31             setNum.append(nums[j])
32             i = j
33             j += 1
34         else:
35             j += 1
36 
37     return setNum