LeetCode/Java/501.java at master · strengthen/LeetCode · 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
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
__________________________________________________________________________________________________
sample 0 ms submission
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int max = 0;
    int counter = 1;
    TreeNode prev = null;

    public int[] findMode(TreeNode root) {
        List<Integer> result = new ArrayList<>();

        inOrder(root, result);

        if(result.size() < 1)
            return new int[0];

        int[] ans = new int[result.size()];

        for(int i = 0; i < result.size(); i++){
            ans[i] = result.get(i);
        }

        return ans;

    }


    public void inOrder(TreeNode root, List<Integer> result){

        if(root == null)
            return;

        inOrder(root.left, result);

        if(prev != null){
            if(prev.val == root.val)
                counter++;
            else{
                counter = 1;
            }
        }

        prev = root;

        if(counter > max){
            result.clear();
            result.add(root.val);
            max = counter;

        }else if(counter == max){
            result.add(root.val);
        }

        inOrder(root.right, result);
    }
}
__________________________________________________________________________________________________
sample 37884 kb submission
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private int currVal;
    private int currCount = 0;
    private int maxCount = 0;
    private int modeCount = 0;

    ArrayList<Integer> modes;

    public int[] findMode(TreeNode root) {
        inorder(root, false);
        modes = new ArrayList<>();
        maxCount = Math.max(maxCount, currCount);
        modeCount = 0;
        currCount = 0;
        System.out.println(maxCount);
        inorder(root, true);
        int[] mode = new int[modes.size()];
        int i =0;
        for(int n: modes)
            mode[i++] = n;
        return mode;
    }


    private void handleValue(int val, boolean flag) {
        if(flag)
        {
            if(currVal != val)
            {
                currVal = val;
                currCount = 0;
            }
            currCount ++;
            if(currCount == maxCount)
                {
                    modes.add(currVal);
                }
        }
        else
        {
            if(val != currVal)
            {
                maxCount = Math.max(maxCount, currCount);
                currVal = val;
                currCount = 0;
            }
            currCount ++;
        }

    }

    private void inorder(TreeNode root, boolean flag) {
        if (root == null) return;
        inorder(root.left, flag);
        handleValue(root.val, flag);
        inorder(root.right, flag);
    }
}
__________________________________________________________________________________________________