?LeetCode刷題實(shí)戰(zhàn)442：數(shù)組中重復(fù)的數(shù)據(jù)
Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice.
You must write an algorithm that runs in O(n) time and uses only constant extra space.
示例
輸入:
[4,3,2,7,8,2,3,1]
輸出:
[2,3]
解題
class?Solution?{
????public?ListfindDuplicates(int[] nums) {
????????Listres = new?ArrayList<>();
????????for(int?i = 0;i < nums.length;++i){
????????????int?index = Math.abs(nums[i])-1;
????????????if(nums[index] < 0){
????????????????res.add(index+1);
????????????}else?if(nums[index] > 0){
????????????????nums[index] *= -1;
????????????}
????????}
????????return?res;
????}
}
LeetCode1-440題匯總，希望對(duì)你有點(diǎn)幫助！
LeetCode刷題實(shí)戰(zhàn)441：排列硬幣
評(píng)論
圖片
表情