https://chenchen.zone/老大爷 好好滴写代码，不要想那么多，钱钱会有的, leetCode2019-02-23T11:37:02+08:00老大爷LeetCode: Majority ElementMaggienullhttps://chenchen.zone/articles/2018/11/19/1542588424014.html2018-11-19T08:47:04+08:00Majority 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 always exist in the array.leetCode: Sqrt(x)Maggienullhttps://chenchen.zone/articles/2018/11/12/1542037382172.html2018-11-13T09:21:25+08:00Implement int sqrt(int x).
Compute and return the square root of x, where x is guaranteed to be a non-negative integer.
Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.