http://47.95.194.85/老大爷 no can, but will, leetCode2018-12-12T19:38:26+08:00老大爷LeetCode: Majority ElementMaggienullhttp://47.95.194.85/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)Maggienullhttp://47.95.194.85/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.