def removeDuplicates(nums):
if len(nums) <= 1:
return len(nums)
else:
cur_index = 1
while cur_index <= len(nums) - 1:
if nums[cur_index] == nums[cur_index - 1]:
del nums[cur_index]
else:
cur_index += 1
return len(nums)
class Solution:
'''
sdacsdcs
'''
def removeDuplicates(nums):
if (len(nums) == 0):
return 0
cur=0
count=1
for i in range(1,len(nums)):
if(nums[i]!=nums[cur]):
cur+=1
count+=1
nums[cur]=nums[i]
return(len(nums[:count]))
nums = [1,1,2]
def myans(num):
if (len(num) <= 1):
return 0
print(myans(nums))
nums = [1,1,2]
def func(num):
df = []
for i in num:
if i not in df:
df.append(i)
print(len(df))
func(nums)
class Solution1:
def reverseString(self, s):
s.reverse()<Paste>
#Approach 1: Recursion, In-Place, \mathcal{O}(N)O(N) Space
class Solution2:
def reverseString(self, s):
def helper(left, right):
if left < right:
s[left], s[right] = s[right], s[left]
helper(left + 1, right - 1)
helper(0, len(s) - 1)
Approach 2: Two Pointers, Iteration
class Solution3:
def reverseString(self, s):
left, right = 0, len(s) - 1
while left < right:
s[left], s[right] = s[right], s[left]
left, right = left + 1, right - 1