Bit Manipulation
文章平均质量分 61
candy_crush
胡编乱写
展开
-
Majority Element
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原创 2016-09-02 21:54:41 · 176 阅读 · 0 评论 -
Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums = [0, 1, 3] return 2. 数组包含n个不同的数,这些数来自0, 1, 2, ..原创 2016-09-02 23:15:23 · 257 阅读 · 0 评论