LeetCode: Find All Duplicates in an Array

这里只能出现2次或者1次,不可能有3次或者3次以上

 1 public class Solution {
 2     public List<Integer> findDuplicates(int[] nums) {
 3         List<Integer> ans = new ArrayList<Integer>();
 4         for (int i = 0; i < nums.length; i++) {
 5             int val = Math.abs(nums[i]) - 1;
 6             if (nums[val] < 0) ans.add(val+1);
 7             nums[val] = -nums[val];
 8         }
 9         return ans;
10     }
11 }
原文地址:https://www.cnblogs.com/yingzhongwen/p/6552927.html