题目:

题解:
class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
int n = nums.length;
for (int num : nums) {
int x = (num - 1) % n;
nums[x] += n;
}
List<Integer> ret = new ArrayList<Integer>();
for (int i = 0; i < n; i++) {
if (nums[i] <= n) {
ret.add(i + 1);
}
}
return ret;
}
}











![LangChain进阶技巧:提高聊天机器人性能的策略[第三课]](https://i-blog.csdnimg.cn/direct/5ce647f465b9434e813c3c2970f48c16.png#pic_center)







