Game 280 weekly

The first 280 Weekly match

*6004. obtain 0 The number of operations

class Solution:
    def countOperations(self, num1: int, num2: int) -> int:
        res = 0
        #  Ordinary people solve 
        # while num1 and num2:
        # res += 1
        # if num1 > num2: num1 -= num2
        # else: num2 -= num1
        
        # * Bull man solution ： division   Lingcha mountain AI house 
        while num1 > 0:
            res += num2 // num1
            num1, num2 = num2 % num1, num1
            
        return res

class Solution {
    
    public int countOperations(int num1, int num2) {
    
        int res = 0;
        while (num1 > 0){
    
            res += num2 / num1;
            int tmp = num1;
            num1 = num2 % num1;
            num2 = tmp;
        }
        return res;
    }
}

6005. The minimum number of operands to make an array an alternating array

class Solution:
    def minimumOperations(self, nums: List[int]) -> int:   
        n = len(nums)
        if n == 1: return 0        
        a, b = Counter(nums[::2]), Counter(nums[1::2])          
        a = sorted(a.items(), key = lambda x: -x[1])   
        b = sorted(b.items(), key = lambda x: -x[1])
        
        if a[0][0] != b[0][0]: #  In two arrays , The elements that appear most often are different 
            return n - a[0][1] - b[0][1]
        else:                       
            cost0 = n - a[0][1] - (0 if len(b) == 1 else b[1][1])   
            cost1 = n - b[0][1] - (0 if len(a) == 1 else a[1][1])   
            
            return min(cost0, cost1) 

6006. Take out the smallest number of magic beans

6007. The maximum sum of the array