package solution;


import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.stream.Collectors;

public class test {
    public static void main(String[] args) {
        int[] nums1 = new int[]{1,2,3,0,0,0};
//        int m = 3;
//        int[] nums2 = new int[]{2,5,6};
//        int n = 3;
//        int[] nums1 = new int[]{1};
//        int m = 1;
//        int[] nums2 = new int[]{};
//        int n = 0;
//        Solution.merge(nums1,m,nums2,n);
//        String[] strs = new String[]{"flower","flow","flight"};
//        String[] strs = new String[]{"flower","flower","flower","flower"};
//        String result =  Solution.longestCommonPrefix(strs);
//        System.out.println(result);
        int m = Solution.majorityElement(nums1);
        System.out.println(m);
    }

}