参考代码：

class Solution:
    def majorityNumber(self, nums):
        nums.sort()
        i = 0
        j = 0
        while i <= len(nums):
            j = nums.count(nums[i])
            if j > len(nums)//3:
                return nums[i]
            i += j
        return