[LeetCode] 169. Majority Element 求大多数

Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume t
posted @ 2015-01-19 12:54  Grandyang  阅读(26627)  评论(19)    收藏  举报
Fork me on GitHub