I don't like old-style indexed looping. I much prefer the "enhanced" (Java) / "range-based" (C++) loops, they make things much cleaner.

**C++**

```
int removeDuplicates(vector<int>& nums) {
int i = 0;
for (int n : nums)
if (!i || n > nums[i-1])
nums[i++] = n;
return i;
}
```

And to not need the `!i`

check in the loop:

```
int removeDuplicates(vector<int>& nums) {
int i = !nums.empty();
for (int n : nums)
if (n > nums[i-1])
nums[i++] = n;
return i;
}
```

**Java**

```
public int removeDuplicates(int[] nums) {
int i = 0;
for (int n : nums)
if (i == 0 || n > nums[i-1])
nums[i++] = n;
return i;
}
```

And to not need the `i == 0`

check in the loop:

```
public int removeDuplicates(int[] nums) {
int i = nums.length > 0 ? 1 : 0;
for (int n : nums)
if (n > nums[i-1])
nums[i++] = n;
return i;
}
```