-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRemoveDuplicatesFromSortedArrayII.java
More file actions
69 lines (67 loc) · 2.4 KB
/
RemoveDuplicatesFromSortedArrayII.java
File metadata and controls
69 lines (67 loc) · 2.4 KB
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
package com.yangchd.leetcode.medium;
/**
* @author yangchd 2018/11/12.
*
* 80. Remove Duplicates from Sorted Array II
* Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice 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,1,2,2,3],
* Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.
* It doesn't matter what you leave beyond the returned length.
*
* Example 2:
* Given nums = [0,0,1,1,1,1,2,3,3],
* Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 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]);
* }
*
*/
public class RemoveDuplicatesFromSortedArrayII {
class Solution {
public int removeDuplicates(int[] nums) {
if (null == nums || nums.length <= 0) {
return 0;
}
int index = 0;
int num = nums[0];
int i = 1;
int sum = 0;
for (int j = 1; j < nums.length; j++) {
if (num == nums[j]) {
if (i < 2) {
i++;
}
} else {
sum += i;
for (int k = 0; k < i; k++) {
nums[index++] = num;
}
num = nums[j];
i = 1;
}
}
if (i > 0) {
sum += i;
for (int k = 0; k < i; k++) {
nums[index++] = num;
}
}
return sum;
}
}
}