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

    思路:

    用一个flag标记nums 中的数字是否出现过。如果出现过说明重复了。

    最后再扫描一遍flag数组,如果有false标记说明没有出现过。

    vector<int> findErrorNums(vector<int>& nums)
        {
            vector<int> ret;
            vector<bool>flag(nums.size()+1,false);
    
            for (int i = 0; i < nums.size();i++)
            {
                 if (flag[nums[i]] == true)ret.push_back(nums[i]);             
                 flag[nums[i]] = true;                  
            }
            for (int i = 1; i < flag.size(); i++)
            {
                if (flag[i] == false)ret.push_back(i);             
            }
            return ret;
        }
  • 相关阅读:
    访友
    幼儿园分班
    求一个数的平方根
    计数器
    连续数组的最大和
    给定一个权重数组,实现一个带权重的路由策略
    两个超长字符串相加
    参数解析(得到输入参数)
    对字符串中的所有单词进行倒排。
    推荐PHP程序员进阶的好书
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/7224279.html
Copyright © 2011-2022 走看看