-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path26. Remove Duplicates from Sorted Array.py
117 lines (97 loc) · 3.19 KB
/
26. Remove Duplicates from Sorted Array.py
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
# Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.
# Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
# Example 1:
# Given nums = [1,1,2],
# Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
# It doesn't matter what you leave beyond the returned length.
# Example 2:
# Given nums = [0,0,1,1,1,2,2,3,3,4],
# Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
# It doesn't matter what values are set beyond the returned length.
# Clarification:
# Confused why the returned value is an integer but your answer is an array?
# Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
# Internally you can think of this:
# // nums is passed in by reference. (i.e., without making a copy)
# int len = removeDuplicates(nums);
# // any modification to nums in your function would be known by the caller.
# // using the length returned by your function, it prints the first len elements.
# for (int i = 0; i < len; i++) {
# print(nums[i]);
# }
# too slow
class Solution(object):
def removeDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
i = 0
count = 1
max_length = len(nums)
while i < max_length-1:
# print i
# print nums
# print max_length
# print
j=i+1
d=0
while j <= max_length-1 and nums[i] == nums[j]:
j=j+1
d=d+1
if j <= max_length-1:
count = count + 1
if j>i+1:
k=i+1
while j < max_length:
nums[k] = nums[j]
j=j+1
k=k+1
max_length = max_length - d
i=i+1
# print nums
return count
# Accepted
class Solution(object):
def removeDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums) == 0:
return 0
i = 0
count = 1
max_length = len(nums)
while i < max_length-1:
while i < max_length-1 and nums[i] == nums[i+1]:
i=i+1
if i < max_length-1:
nums[count] = nums[i+1]
count = count + 1
i=i+1
return count
a=Solution()
a.removeDuplicates([0,0])
a.removeDuplicates([0,0,1,1,1,2,2,3,3,4])
# Solution provide by Leetcode, slightly faster
class Solution(object):
def removeDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums) == 0:
return 0
i = 0
j = 1
max_length = len(nums)
while j < max_length:
if nums[i] != nums[j]:
i=i+1
nums[i]=nums[j]
j=j+1
return i+1
a=Solution()
a.removeDuplicates([0,0])
a.removeDuplicates([0,0,1,1,1,2,2,3,3,4])