Skip to content

Commit 40f605a

Browse files
date:2019/2/28
author:ZhaoJinnan task:从排序数组中删除重复项
1 parent 95271d2 commit 40f605a

File tree

2 files changed

+40
-3
lines changed

2 files changed

+40
-3
lines changed

.idea/vcs.xml

Lines changed: 2 additions & 3 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
package 从排序数组中删除重复项;
2+
/**
3+
* 从排序数组中删除重复项
4+
* date:2019/2/28
5+
* author:XuMingyang
6+
*/
7+
8+
import java.util.*;
9+
10+
public class Test {
11+
public static void main(String[] args) {
12+
int[] nums = {-3,-1,0,0}; // 源数组
13+
int a = a(nums);
14+
for(int i = 0;i<a;i++){
15+
System.out.println(nums[i]);
16+
}
17+
}
18+
public static int a(int[] nums) {
19+
ArrayList a = new ArrayList(); //通过ArrayList的contains方面判断是否重复
20+
int j = 0; //源数组指针
21+
/**
22+
* date:2019/2/28
23+
* author:ZhaoJinnan
24+
* 源数组由源数组指针位置开始,判断是否在ArrayList中存在。
25+
* 如果不存在则将该元素添加到ArryList中,且将该元素至于源数组指针的位置,然后指针移动。
26+
* 如果重复则直接跳过。直到结束。
27+
* 之后返回指针。
28+
*/
29+
for(int i=0; i<nums.length; i++){
30+
if(!a.contains(nums[i])){
31+
a.add(nums[i]);
32+
nums[j] = nums[i];
33+
j++;
34+
}
35+
}
36+
return j;
37+
}
38+
}

0 commit comments

Comments
 (0)