Approach

# 按照題目操作兩個數字，直到其中一方為0
Perform operations on the two numbers according to the problem statement until one of them becomes zero.

Time Complexity

O(1)

Space Complexity

O(1)

Code

class Solution {
public:
    int countOperations(int num1, int num2) {
        int cnt = 0;

        while (num1 > 0 && num2 > 0) {
            if (num1 < num2) {
                num2 = num2 - num1;
            }
            else if (num1 > num2) {
                num1 = num1 - num2;
            }
            else {
                num1 = num1 - num2;
            }
            cnt++;
        }

        return cnt;
    }
};