-
Notifications
You must be signed in to change notification settings - Fork 0
/
50.java
24 lines (24 loc) · 1.02 KB
/
50.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
public class Solution {
// Parameters:
// numbers: an array of integers
// length: the length of array numbers
// duplication: (Output) the duplicated number in the array number,length of duplication array is 1,so using duplication[0] = ? in implementation;
// Here duplication like pointor in C/C++, duplication[0] equal *duplication in C/C++
// 这里要特别注意~返回任意重复的一个,赋值duplication[0]
// Return value: true if the input is valid, and there are some duplications in the array number
// otherwise false
public boolean duplicate(int numbers[],int length,int [] duplication) {
if(numbers==null || length<=1) return false;
boolean []tmp=new boolean[length];
for(int i=0;i<length;i++)
{
if(tmp[numbers[i]]==true)
{
duplication[0]=numbers[i];
return true;
}
tmp[numbers[i]]=true;
}
return false;
}
}