首页 > itarticle > 645. set mismatch

645. set mismatch

admin 11月 16, 2020 0

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.

Example 1:

1
2
 
Input: nums = [1,2,2,4]
Output: [2,3]
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
class  {
    public int[] findErrorNums(int[] nums) {
        int[] arr = new int[2];
     Set<Integer> set = new HashSet<>();
     for (int i = 0; i < nums.length; i++) {
         if (set.contains(nums[i])) {
                arr[0] = nums[i];
            } else {
                set.add(nums[i]);
            }
        }
        int sum1 = 0;
       int sum2 = 0;
       for (int i = 0; i < nums.length; i++) {
         sum1 += nums[i];
         sum2 += (i + 1);
     }
        arr[1] = sum2 - (sum1 - arr[0]);
     return arr;
    }
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能