-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOperationsToZero.cpp
More file actions
54 lines (47 loc) · 1.61 KB
/
OperationsToZero.cpp
File metadata and controls
54 lines (47 loc) · 1.61 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/*
You are given two non-negative integers num1 and num2.
In one operation, if num1 >= num2, you must subtract num2 from num1, otherwise
subtract num1 from num2.
For example, if num1 = 5 and num2 = 4, subtract num2 from num1, thus
obtaining num1 = 1 and num2 = 4. However, if num1 = 4 and num2 = 5, after one
operation, num1 = 4 and num2 = 1.
Return the number of operations required to make either num1 = 0 or num2 = 0.
Example 1:
Input: num1 = 2, num2 = 3
Output: 3
Explanation:
- Operation 1: num1 = 2, num2 = 3. Since num1 < num2, we subtract num1 from num2 and get num1 = 2, num2 = 3 - 2 = 1.
- Operation 2: num1 = 2, num2 = 1. Since num1 > num2, we subtract num2 from num1.
- Operation 3: num1 = 1, num2 = 1. Since num1 == num2, we subtract num2 from num1.
Now num1 = 0 and num2 = 1. Since num1 == 0, we do not need to perform any further operations.
So the total number of operations required is 3.
Example 2:
Input: num1 = 10, num2 = 10
Output: 1
Explanation:
- Operation 1: num1 = 10, num2 = 10. Since num1 == num2, we subtract num2 from num1 and get num1 = 10 - 10 = 0.
Now num1 = 0 and num2 = 10. Since num1 == 0, we are done.
So the total number of operations required is 1.
*/
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int countOperations(int num1, int num2) {
int cnt=0;
while(true)
{
if(num1==0 || num2==0)
return cnt;
else
{
if(num1>num2)
num1-=num2;
else
num2-=num1;
}
cnt++;
}
return cnt;
}
};