[LintCode/LeetCode] Set Mismatch



The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of one number and loss of another number.

Given an array nums representing the data status of this set after the error. Your task is to firstly find the number occurs twice and then find the number that is missing. Return them in the form of an array.


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


public class Solution {
     * @param nums: an array
     * @return: the number occurs twice and the number that is missing
    public int[] findErrorNums(int[] nums) {
        // Write your code here
        int[] res = new int[2];
        Set<Integer> set = new HashSet<>();
        for (int i = 0; i < nums.length; i++) {
            if (set.contains(nums[i])) res[0] = nums[i];
            else set.add(nums[i]);
            // put the commented for-loop here
            if (!set.contains(i+1)) res[1] = i+1;
        // for (int i = 0; i < nums.length; i++) {
        //     if (!set.contains(i+1)) {
        //         res[1] = i+1;
        //         break;
        //     }
        // }
        return res;
阅读 1.2k

Road to Glory
對酒當歌,人生幾何? 譬如朝露,去日苦多。
161 声望
53 粉丝
0 条评论
161 声望
53 粉丝