forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BrokenCalculator.cpp
54 lines (51 loc) · 1.4 KB
/
BrokenCalculator.cpp
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
// Source : https://leetcode.com/problems/broken-calculator/
// Author : Hao Chen
// Date : 2019-05-01
/*****************************************************************************************************
*
* On a broken calculator that has a number showing on its display, we can perform two operations:
*
* Double: Multiply the number on the display by 2, or;
* Decrement: Subtract 1 from the number on the display.
*
* Initially, the calculator is displaying the number X.
*
* Return the minimum number of operations needed to display the number Y.
*
* Example 1:
*
* Input: X = 2, Y = 3
* Output: 2
* Explanation: Use double operation and then decrement operation {2 -> 4 -> 3}.
*
* Example 2:
*
* Input: X = 5, Y = 8
* Output: 2
* Explanation: Use decrement and then double {5 -> 4 -> 8}.
*
* Example 3:
*
* Input: X = 3, Y = 10
* Output: 3
* Explanation: Use double, decrement and double {3 -> 6 -> 5 -> 10}.
*
* Example 4:
*
* Input: X = 1024, Y = 1
* Output: 1023
* Explanation: Use decrement operations 1023 times.
*
* Note:
*
* 1 <= X <= 10^9
* 1 <= Y <= 10^9
******************************************************************************************************/
class Solution {
public:
int brokenCalc(int X, int Y) {
if (X >= Y) return X-Y ;
if ( Y%2 ==0 ) return brokenCalc(X, Y/2) + 1;
return brokenCalc(X, Y+1) + 1;
}
};