Majority Element

# 先排序好

# 將矩陣減去每一個元素

#找出最多0的那一個值

def majority_element(nums)

nums = nums.sort!

if nums.size == 1
return nums[0]
end
for i in 0..nums.size-2

a=Array.new(nums.size,nums[i])

nums_new = nums-a

nums_new.delete(0)

if nums_new.size < nums.size/2.round(1)
b = nums[i]
else

end
end

return b

end

majority_element([0]) #should return 0.
#majority_element([1,1,2,1,3]) #should return 1.