![](https://img-blog.csdnimg.cn/direct/0e90f08ec68d48bdba29606081c3f44d.png)
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;
}
};
![](https://img-blog.csdnimg.cn/direct/19409769139043eba7e4ac152315f131.png)
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();
}
};