Skip to content

leet code

3270 - Find All Numbers Disappeared in an Array

 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
class Solution {
public:
    vector<int> findDisappearedNumbers(vector<int>& nums) {
        vector<int> rslt;
        int size = nums.size();
        int tmp = 0;
        int idx = 0;
        for(int i=0; i<size; ++i)
            nums[i]--;

        for(int i=0; i<size; ++i)
        {
            idx = nums[i];
            while(idx!=nums[idx])
            {
                tmp = nums[idx];
                nums[idx] = idx;
                idx = tmp;
            }
        }
        for(int i=0; i<size; ++i)
        {
            printf("%d\n", nums[i]);
            if(nums[i]+1 != i+1)
            {
                rslt.push_back(i+1);
            }
        }

        return rslt;
    }
};

3231 - Third Maximum Number

코드가 좀 더러운 듯(시간 나면 다시 풀어보기)

 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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
class Solution {
public:
    int thirdMax(vector<int>& nums) {
        int tmp=0;
        bool dup = false;

        int size = nums.size();
        long arr[4] = {0, -2147483649, -2147483649, -2147483649};
        for(int i=0; i<size; ++i)
        {
            dup = false;
            for(int j=1; j<4; ++j)
            {
                if(nums[i] == arr[j] && (arr[j] != -2147483649))
                {
                    dup= true;
                    break;
                }
            }
            if(!dup)
            {
                arr[0] = nums[i];
                sort(arr);
            }

        }
        if(arr[1] !=-2147483649)
        {
            return arr[1];
        }else
        {
            return arr[3];
        }
    }

private:
    void sort(long* arr)
    {
        long min = 0;
        int idx = 0;
        long tmp = 0;
        for(int i=0; i<4; ++i)
        {
            min = arr[i];
            idx = i;
            for(int j=i+1; j<4; ++j)
            {
                if(arr[j] < min)
                {
                    idx = j;
                    min = arr[j];
                }
            }
            tmp = arr[i];
            arr[i] = arr[idx];
            arr[idx] = tmp;
        }
    }
};