Let-Us-Java/LeetCodeSolutions/SetMismatch.java at master · CodeNerve/Let-Us-Java

This repository was archived by the owner on Nov 25, 2022. It is now read-only.

30 lines (26 loc) · 795 Bytes

// https://leetcode.com/problems/set-mismatch/

public class SetMismatch {

public static int[] findErrorNums(int[] arr) {

int i = 0;

while (i < arr.length) {

int correct = arr[i] - 1;

if (arr[i] != arr[correct]) {

swap(arr, i , correct);

} else {

i++;

}

// search for first missing number

for (int index = 0; index < arr.length; index++) {

if (arr[index] != index + 1) {

return new int[] {arr[index], index+1};

}

return new int[] {-1, -1};

}

static void swap(int[] arr, int first, int second) {

int temp = arr[first];

arr[first] = arr[second];

arr[second] = temp;

}

Provide feedback