// método 1 public static int majorElement_1 ( int [] num) { int major = num [0], count = 1 ; for ( int i = 1; i <num.length; i ++ ) { if (count == 0 ) { count ++ ; mayor = num [i]; } else if (major == num [i]) { count ++ ; } más cuenta-- ; } volver mayor; } // método 2 pública estática int majorityElement_2 ( int [] nums) { Arrays.sort (nums); return nums [nums.length / 2 ]; } // método 3 public static int mayoríaElemento_3 ( int [] nums) { Map <Integer, Integer> myMap = new HashMap <Integer, Integer> (); // Hashtable <Integer, Integer> myMap = new Hashtable <Integer, Integer> (); int ret = 0 ; para ( int num: nums) { if (! myMap.containsKey (num)) myMap.put (num, 1 ); más myMap.put (num, myMap.get (num) +1 ); if (myMap.get (num)> nums.length / 2 ) { ret = num; romper ; } } return ret; }