#solution:
###two different number make a pair, after making the total list do the match, the majority number must have at least 1 element that can not match. the rest element(s) that not matched is the majority number.
###here i use a stack to solve the problem, it takes 356 ms, i don't think it's fast enough