g0601_0700.s0645_set_mismatch.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0601_0700.s0645_set_mismatch;
// #Easy #Array #Hash_Table #Sorting #Bit_Manipulation
// #2022_03_21_Time_2_ms_(97.45%)_Space_43.6_MB_(89.93%)
public class Solution {
public int[] findErrorNums(int[] nums) {
int[] ans = new int[2];
int i = 0;
while (i < nums.length) {
int correct = nums[i] - 1;
if (nums[i] != nums[correct]) {
int temp = nums[i];
nums[i] = nums[correct];
nums[correct] = temp;
} else {
i++;
}
}
for (int a = 0; a < nums.length; a++) {
if (nums[a] != a + 1) {
ans[0] = nums[a];
ans[1] = a + 1;
break;
}
}
return ans;
}
}