Boyer-Moore voting algorithm more than one third size of element

https://leetcode.com/problems/majority-element-ii/submissions/
class Solution:
    def majorityElement(self, nums: List[int]) -> List[int]:
        if not nums:
            return nums
        n=len(nums)
        num1=-1
        num2=-1
        c1=0
        c2=0
        for i in range(n):
            if num1==nums[i]:
                c1+=1
            elif num2==nums[i]:
                c2+=1
            else:
                if c1==0:
                    c1=1
                    num1=nums[i]
                elif c2==0:
                    c2=1
                    num2=nums[i]
                else:
                    c1=c1-1
                    c2=c2-1
        print(num1,num2)
        f1=f2=0#actual frequencies
        for i in range(n):
            if nums[i]==num1:
                f1+=1
            elif nums[i]==num2:
                f2+=1
        print(f1,f2)
        t=[]
        if f1>n//3:
            t.append(num1)
        if f2>n//3:
            t.append(num2)
        return t