leetcode

0 class Solution {

1 public:

2 vector<int> findDisappearedNumbers(vector<int> &nums) {

3 vector<int> res;

4

5 for (int i = 0; i < nums.size(); i++) {

6 int index = abs(nums[i]) - 1;

7 if (nums[index] > 0) nums[index] = -nums[index];

8 }

9

10 for (int i = 0; i < nums.size(); i++)

11 if (nums[i] > 0) res.push_back(i + 1);

12

13 return res;

14 }

15 };