链接
牛客:数组中重复的数字
LeetCode:剑指 Offer 03. 数组中重复的数字
思路
申请长度为 n 的 boolean 型数组空间,默认为 false,判断每位是否已经有值,遍历数组,发现当前数值对应下标的 boolean 数组为false,就设置数值对应下标的值为true,如果发现已经为 true,说明已经找到重复,返回即可。
代码
牛客:
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) {
boolean[] k = new boolean[length];
for (int i = 0; i < k.length; i++) {
if (k[numbers[i]] == true) {
duplication[0] = numbers[i];
return true;
}
k[numbers[i]] = true;
}
return false;
}
}
LeetCode:
class Solution {
public int findRepeatNumber(int[] nums) {
boolean[] reduplicateArr = new boolean[nums.length];
for(int i=0; i<nums.length; i++){
if(reduplicateArr[nums[i]]==true){
return nums[i];
}
reduplicateArr[nums[i]] = true;
}
return 0;
}
}