T: O(n)
S: O(1)
class Solution { public int removeDuplicates(int[] nums) { int n = nums.length; int c = 1; for (int i = 1; i < n; i++) { if (nums[c-1] != nums[i]) { nums[c] = nums[i]; c++; } } return c; } }
Last updated 3 years ago
Was this helpful?