169. Majority Element
2018-03-08 23:26
232 查看
Given an array of size n, find the majority element. The majority
element is the element that appears more than ⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element
always exist in the array.
element is the element that appears more than ⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element
always exist in the array.
public int majorityElement(int[] nums) { Arrays.sort(nums); return nums[nums.length/2]; }
相关文章推荐
- leetcode-169. Majority Element
- [Leetcode从零开刷]169.Majority Element
- 169.Majority Element && 229. Majority Element II
- [leetcode] 169. Majority Element
- leetcode No169. Majority Element
- 2018.03.07 leetcode 打卡 #169. Majority Element
- 【一天一道LeetCode】#169. Majority Element
- LeetCode 229. Majority Element II ,169. Majority Element
- [LeetCode]--169. Majority Element
- LeetCode 169. Majority Element
- LeetCode 169. Majority Element(Java)
- [LeetCode]169. Majority Element
- LeetCode Problem No'169 Majority Element
- leetcode:169. Majority Element
- [LeetCode]169. Majority Element(多数元素)
- 【LeetCode】169. Majority Element(Easy)解题报告
- LeetCode之路:169. Majority Element
- LeetCode Problem 169: Majority Element查找多数元素
- 169. Majority Element
- LeetCode 169. Majority Element