Count Operations to Obtain Zero LeetCode solution in Java

1
class Solution {
2
  public int countOperations(int num1, int num2) {
3
    int count = 0;
4
    while (num1 != 0 && num2 != 0) {
5
      if (num1 < num2) {
6
        count += num2 / num1;
7
        num2 = num2 % num1;
8
      } else {
9
        count += num1 / num2;
10
        num1 = num1 % num2;
11
      }
12
    }
13
    return count;
14
  }
15
}