Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
26 lines (25 loc) · 771 Bytes

File metadata and controls

26 lines (25 loc) · 771 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package leetcode._26_;
class Solution {
public int removeDuplicates(int[] nums) {
if (nums.length == 0) {
return 0;
}
int len = 1;
int emptyIndex = -1; // 可以放下一个元素的位置
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] == nums[i + 1] && emptyIndex == -1) {
emptyIndex = i + 1;
}
// if (i + 2 == nums.length && emptyIndex == -1){ // 表示全部不重复
// return nums.length;
// }
if (nums[i] != nums[i + 1]) {
len++;
if (emptyIndex!=-1) {
nums[emptyIndex++] = nums[i + 1];
}
}
}
return len;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.