leetcode + 一串数组里数字,找到0->n最开始不存在的数字,set进行hash

https://leetcode.com/problems/missing-number/description/

class Solution {
public:
    int missingNumber(vector<int>& nums) {
        set<int>st;
        for(int i=0; i<nums.size(); i++) st.insert(nums[i]);
        for(int i=0;i<=nums.size();i++){
            if(!st.count(i)) return i;
        }
    }
};

猜你喜欢

转载自blog.csdn.net/u013554860/article/details/81152936