class Solution { public int MoreThanHalfNum_Solution(int [] array) { QuickSort(array, array.length - 1); int Record = 1; int i = 0; for (; i < array.length - 1; i++) { if (array[i] == array[i + 1]) { Record++; if (Record > array.length / 2) { break; } } else { Record = 1; } } return array[i]; ...
