Leetcode-Basic/NumbersDisappeared.java at main · kavya-7777/Leetcode-Basic · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
<<<<<<< HEAD
//448. Find All Numbers Disappeared in an Array

class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        int n = nums.length;
        int freq[] = new int[n + 1];
        List<Integer> list = new ArrayList<>();
        for(int i=0;i<n;i++){
            freq[nums[i]]++;
        }
        for(int i=1;i<=n;i++){
            if(freq[i] == 0) list.add(i);
        }
        return list;
    }
=======
//448. Find All Numbers Disappeared in an Array

class Solution {
    public List<Integer> findDisappearedNumbers(int[] nums) {
        int n = nums.length;
        int freq[] = new int[n + 1];
        List<Integer> list = new ArrayList<>();
        for(int i=0;i<n;i++){
            freq[nums[i]]++;
        }
        for(int i=1;i<=n;i++){
            if(freq[i] == 0) list.add(i);
        }
        return list;
    }
>>>>>>> be6ce0b427078b1421d5dd74adb2300dc02daeec
}