摘要: def quickSort(nums): low = [] equal = [] hi = [] l = len(nums) if l>1: v = nums[0] for n in nums: if n v: hi.append(n) ... 阅读全文
posted @ 2018-02-04 21:15 YWU 阅读(127) 评论(0) 推荐(0)