import java.util.HashMap;
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<=0 )
return false;
HashMap<Integer,Integer> map = new HashMap<>();
for(int i=0;i<numbers.length;i++){
if(!map.containsKey(numbers[i])){
map.put(numbers[i],1);
}else{
int count = map.get(numbers[i]);
map.put(numbers[i],++count);
duplication[0] = numbers[i];
return true;
}
}
return false;
}
}
牛客优秀代码
链接:https://www.nowcoder.com/questionTerminal/623a5ac0ea5b4e5f95552655361ae0a8
来源:牛客网
public class Solution {
public boolean duplicate(int numbers[],int length,int [] duplication) {
int[] assist = new int [length];
for(int i = 0; i < length; i++){
if(assist[numbers[i]] == 0){
assist[numbers[i]] ++;
}else{
duplication[0] = numbers[i];
return true;
}
}
return false;
}
}