Sure, here is a Python solution for removing duplicates from a sorted array:

```python
def removeDuplicates(nums):
if not nums:
return 0

i = 0

for j in range(1, len(nums)):
if nums[j] != nums[i]:
i += 1
nums[i] = nums[j]

return i + 1
```

Here's how it works:

1. First, we check if the input list `nums` is empty. If it is, we return 0 because there are no elements to remove duplicates from.

2. We initialize a variable `i` to 0. This variable will keep track of the index of the last unique element we've found.

3. We start a loop from the second element in the list (index 1) to the end of the list.

4. Inside the loop, we check if the current element `nums[j]` is different from the last unique element we've found `nums[i]`. If it is, it means we've found a new unique element.

5. When we find a new unique element, we increment `i` by 1 and replace the element at index `i` with the new unique element. This effectively removes the duplicate element.

6. After the loop finishes, we return `i + 1`, which is the number of unique elements in the list.

This solution works in-place, meaning it doesn't create a new list to store the unique elements. Instead, it modifies the input list directly. It also takes advantage of the fact that the input list is sorted, which guarantees that any duplicate elements will be adjacent to each other.

Question

Sure, here is a Python solution for removing duplicates from a sorted array:

```python
def removeDuplicates(nums):
    if not nums:
        return 0

i = 0

for j in range(1, len(nums)):
        if nums[j] != nums[i]:
            i += 1
            nums[i] = nums[j]

return i + 1
```

Here's how it works:

1. First, we check if the input list `nums` is empty. If it is, we return 0 because there are no elements to remove duplicates from.

2. We initialize a variable `i` to 0. This variable will keep track of the index of the last unique element we've found.

3. We start a loop from the second element in the list (index 1) to the end of the list.

4. Inside the loop, we check if the current element `nums[j]` is different from the last unique element we've found `nums[i]`. If it is, it means we've found a new unique element.

5. When we find a new unique element, we increment `i` by 1 and replace the element at index `i` with the new unique element. This effectively removes the duplicate element.

6. After the loop finishes, we return `i + 1`, which is the number of unique elements in the list.

This solution works in-place, meaning it doesn't create a new list to store the unique elements. Instead, it modifies the input list directly. It also takes advantage of the fact that the input list is sorted, which guarantees that any duplicate elements will be adjacent to each other.

Knowee AI · Accepted Answer