LeetCode 645: 错误集合

桶排序思想

class Solution {
    public int[] findErrorNums(int[] nums) {
    	int[] button = new int[10001];
    	for(int i=0;i<nums.length;++i) {
    		button[nums[i]]++;
    	}
    	int lost=0, bonus=0;
    	for(int i=1;i<=nums.length;++i) {
    		if(button[i]==0) {
    			lost = i;
    		}else if(button[i]==2){
    			bonus= i;
    		}
    	}
    	int[] res = new int[2];
    	res[0] = bonus;
    	res[1] = lost;
    	return res;
    }
}