Last active
September 5, 2016 14:32
-
-
Save yangliyi/91faabd4b47b8b5f34ff to your computer and use it in GitHub Desktop.
LeetCode / Ruby JavaScript
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ##### Ruby ##### | |
| # Solution1 | |
| def majority_element(nums) | |
| h = (nums.size.to_f / 2).ceil | |
| sorted = nums.sort | |
| return sorted[h] | |
| end | |
| # Solution2 | |
| def majority_element(nums) | |
| h = nums.size / 2 | |
| sorted = nums.sort.uniq | |
| for i in 0..(sorted.length-1) do | |
| return sorted[i] if nums.count(sorted[i]) > (h) | |
| end | |
| end | |
| # Solution3 | |
| def majority_element(nums) | |
| return nums[0] if nums.size == 1 | |
| h = (nums.size / 2).ceil | |
| sorted = nums.sort | |
| return sorted[h] | |
| end | |
| ##### JavaScript ##### | |
| # Solution1 | |
| var majorityElement = function(nums) { | |
| if (nums.length === 1) {return nums[0]} | |
| var h = Math.ceil(nums.length / 2); | |
| sorted = nums.sort(); | |
| result = sorted[h]; | |
| return result | |
| }; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment