def paixv(nums): for i in range(len(nums) - 1): for j in range(i + 1, len(nums)): if nums[i] > nums[j]: a = nums[i] nums[i] = nums[j] nums[j] = a return nums # for i in range(len(nums)-1): # if nums[i]!=nums[i+1]: # nums[index+1]=nums[i+1] # index=index+1 # del(nums[index+1:]) # print(nums) def delete(nums): a = 0 while a < len(nums) - 1: if nums[a] == nums[a + 1]: del (nums[a + 1]) else: a = a + 1 return nums if __name__ == '__main__': nums = [0, 0, 1, 0, 1, 8, 43, 2, 1, 4, 6, 7, 8, 9, 2, 2, 3, 3, 4] nums=delete(paixv(nums)) print(nums)
冒泡排序+删除重复项=无序数组的去重排列
最新推荐文章于 2024-01-25 15:37:33 发布