LeetCode-2 Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Note: The algorithm should run in linear time and in O(1) space.

Example 1:

Input: [3,2,3]
Output: [3]
Example 2:

Input: [1,1,1,3,3,2,2,2]
Output: [1,2]

public class App 
{
    public static void main(String[] args){
        int[] input = {3,2};
        int num = input.length / 3;
        System.out.println(num);
        Arrays.sort(input);
        System.out.println(Arrays.toString(input));
        int m = input[0];
        int n = 0;
        for (int i=0; i<input.length; i++){
            if (m != input[i]){
                m = input[i];
                n = i - n;
                if (n > num){
                    System.out.println(input[i-1]);
                }

            }
            if (i == input.length-1){
                n = input.length -n;
                if (n > num){
                    System.out.println(input[i]);
                }
            }

        }
    }
}