【LeetCode】【数组】剑指 Offer 56 - I. 数组中数字出现的次数
剑指 Offer 56 - I. 数组中数字出现的次数class Solution { public int[] singleNumbers(int[] nums) { Arrays.sort(nums); int[] ans = new int[2]; if(nums.length == 0){ return ans; } int i = 0,j = 1,k = 0; //双指针
