wsy182
/
Solution
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

更新 Solution.java

master
wangsiyuan 2023-09-12 16:43:16 +08:00
parent 8bd3a3b7a3
commit 69d78bd534
1 changed files with 4 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
src/solution/Solution.java
View File

@ -174,15 +174,10 @@ public class Solution {
* 元素的 相对顺序 应该保持 一致 。然后返回 nums 中唯一元素的个数。 * 元素的 相对顺序 应该保持 一致 。然后返回 nums 中唯一元素的个数。
*/ */
public static int removeDuplicates(int[] nums) { public static int removeDuplicates(int[] nums) {
int i = 0; if (nums.length == 0) return 0;
for (int j = 0; j < nums.length; j++) { int i = 1; // 从第二个元素开始检查
if (j == 0){ for (int j = 1; j < nums.length; j++) {
nums[i] = nums[j]; if (nums[j] != nums[j - 1]) {
i++;
continue;
}
int preValue = nums[j - 1];
if (nums[j] != preValue){
nums[i] = nums[j]; nums[i] = nums[j];
i++; i++;
} }