zoukankan      html  css  js  c++  java
  • 645. 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.

    Example 1:

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

    Note:

    1. The given array size will in the range [2, 10000].
    2. The given array's numbers won't have any order.

    Approach #1: HashSet. [Java]

    public int[] findErrorNums(int[] nums) {
        Set<Integer> set = new HashSet<>();
        int duplicate = 0, n = nums.length;
        long sum = (n * (n+1)) / 2;
        for(int i : nums) {
            if(set.contains(i)) duplicate = i;
            sum -= i;
            set.add(i);
        }
        return new int[] {duplicate, (int)sum + duplicate};
    }
    

      

    Approach #2: Flip. [Java]

    class Solution {
        public int[] findErrorNums(int[] nums) {
            int[] ret = new int[2];
            for (int n : nums) {
                if (nums[Math.abs(n)-1] < 0) ret[0] = Math.abs(n);
                else nums[Math.abs(n)-1] *= -1;
            }
            for (int i = 0; i < nums.length; ++i) {
                if (nums[i] > 0) ret[1] = i + 1;
            }
            return ret;
        }
    }
    

      

    Reference:

    https://leetcode.com/problems/set-mismatch/discuss/105507/Java-O(n)-Time-O(1)-Space

    https://leetcode.com/problems/set-mismatch/discuss/105528/Simple-Java-O(n)-solution-HashSet

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    关于java.lang.reflect.InvocationTargetException
    Java并发编程(三)后台线程(Daemon Thread)
    Lab 7-2
    Lab 7-1
    Lab 6-3
    Lab 6-2
    Lab 6-1
    Lab 5-1
    Lab 3-4
    Lab 3-3
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10865071.html
Copyright © 2011-2022 走看看