算法分析与设计:leetcode169.Majority Element
专门选择了分治算法的题目,首先选了两道easy难度的题。 题目: 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 no
原创
2017-09-18 00:26:20 ·
511 阅读 ·
0 评论