leetcode_problems/remove_duplicates.py at main · mangalji/leetcode_problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
# nums = [0,0,1,1,1,2,2,3,3,4]
# nums = [1,1,2]
# unique_val = set(nums)

# nums_list = list(unique_val)

# remain_spot = len(nums)-len(unique_val)

# for i in range(remain_spot):
#     # import ipdb; ipdb.set_trace()
#     nums_list.append('_')

# return len(unique_val)
# # return nums_list
# # print(nums_list)
# print(nums)
# unique_val = set(nums)
# nums_list = list(unique_val)
# remain_spot = len(nums)-len(unique_val)
# for i in range(remain_spot):
#     nums_list.append('_')
# print(nums_list)
# nums = nums_list
# print(nums)
# unique_val_list = list(unique_val)
# print(type(unique_val_list))
# # print(unique_val)
# print(unique_val_list)
# print(len(unique_val))


# nums = [1,2,1]
# print(nums)
# # sorted_set = set()
# def remove(nums):
#     sorted_nums = sorted(nums)
#     print(sorted_nums)
#     unique_nums = set(sorted_nums)
#     # print(unique_nums)
#     unique_nums_lst = list(unique_nums)
#     print(unique_nums_lst)
#     remain_spot = len(nums) - len(unique_nums_lst)
#     for i in range(remain_spot):
#         unique_nums_lst.append('_')
#     nums = unique_nums_lst
#     print(nums)
#     return len(unique_nums_lst)

# remove(nums)


# nums = [1,2,1]
# # print(nums)
# nums = sorted(nums)
# unique_nums = set(nums)
# # print(unique_nums)
# # print(unique_nums)
# nums_lst = list(unique_nums)
# # print(nums_lst)

# remain = len(nums) - len(nums_lst)
# # print(remain)
# for i in range(1,remain+1):
#     nums_lst.append('_')
#     # print(i)
# # print(nums_lst)
# nums = nums_lst
# # print(nums)
# length = 0
# for k in nums:
#     if isinstance(k,int):
#         length = length+1
# print(length)
# print(len(unique_nums))
# print(len(unique_nums))

# nums = [1,1,2]
# sorted_nums = sorted(nums)
# unique_nums = set(sorted_nums)
# nums_lst = list(unique_nums)
# remain = len(nums) - len(nums_lst)
# for i in range(remain):
#     nums_lst.append('_')
# nums = nums_lst
# length = 0
# for k in nums:
#     if isinstance(k,int):
#         length += 1
# return length


nums = [1,1,2]

unique_nums = set(nums)
unique_nums_list = list(unique_nums)
nums.clear()
nums.extend(unique_nums_list)
return len(nums)
# print(nums)