645. Set Mismatch(Solution || Leetcode easy || Java)

You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated to another number in the set, which results in repetition of one number and loss of another number.

You are given an integer array nums representing the data status of this set after the error.

Find the number that occurs twice and the number that is missing and return them in the form of an array.

Example 1:

Input: nums = [1,2,2,4]
Output: [2,3]

Example 2:

Input: nums = [1,1]
Output: [1,2]

Constraints:

• 2 <= nums.length <= 104
• 1 <= nums[i] <= 104

SOLUTION:

class Solution {
    public int[] findErrorNums(int[] nums) {
        //Solve using cycle sort, as it is given that it ranges
     // from 1 to n and it will take time complexity of just O(n)
        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++;
            }
        }
        
        int[] ans = new int[2];
        
        for(int j = 0; j < nums.length; j++){
            if(nums[j] != j+1){
                ans[0] = nums[j];
                ans[1] = j+1;
                break;
            }
        }
        
        return ans;
    }
}

Thank you for reading. If you have any queries then, please let me know in the comment section. I will surely be responsive toward it.