g0201_0300.s0287_find_the_duplicate_number.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0201_0300.s0287_find_the_duplicate_number;
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers
// #Bit_Manipulation
public class Solution {
public int findDuplicate(int[] nums) {
int[] arr = new int[nums.length + 1];
for (int i = 0; i < nums.length; ++i) {
arr[nums[i]] += 1;
if (arr[nums[i]] == 2) {
return nums[i];
}
}
return 0;
}
}