leetcode每日一题第七十天

class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        int n = nums.size();
        for(auto num:nums)
        {
            int x = (num-1) % n;
            nums[x] += n;
        }
        vector<int> v;
        for(int i =0;i<n;i++)
        {
            if(nums[i] <= n)
            {
                v.push_back(i+1);
            }
        }
        return v;

    }
};

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> A,B;
    MinStack() {

    }
    
    void push(int x) {
        A.push(x);
        if(B.empty() || B.top()>= x)
        {
            B.push(x);
        }

    }
    
    void pop() {
        if(B.top()==A.top())
        {
            B.pop();
        }
        A.pop();

    }
    
    int top() {
        return A.top();

    }
    
    int getMin() {
        return B.top();

    }
};