leetcode/prob501.java at master · dilemmawalker/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
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;zz
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int[] findMode(TreeNode root) {
        ArrayList<Integer>arr=new ArrayList<>();
        solve(root,arr);

        int val=0;
        ArrayList<Integer>ans=new ArrayList<>();
        int arr.size();
        int s=0;
        for(int i=0;i<n;i++){
            if((i+1)<n && arr.get(i)==arr.get(i+1)){
                s++;
            }
            else{
                s++;
                if(s>val){
                    val=s;
                    ans=new ArrayList<Integer>();
                    ans.add(arr.get(i));
                }
                else if(s==val){
                    ans.add(arr.get(i));
                }
                s=0;
            }
        }

        n=ans.size();
        int[]anss=new int[n];
        for(int i=0;i<n;i++){
            anss[i]=ans.get(i);
        }
        return anss;
    }
    public void solve(root,arr){    //return inorder
        if(root==null)
        return;

        solve(root.left,arr);
        arr.add(root.val);
        solve(root.right,arr);

    }
}