-
Notifications
You must be signed in to change notification settings - Fork 14
/
remove-k-digits.cpp
71 lines (65 loc) · 1.63 KB
/
remove-k-digits.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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
// Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.
//
//
// Note:
//
// The length of num is less than 10002 and will be ≥ k.
// The given num does not contain any leading zero.
//
//
//
//
// Example 1:
//
// Input: num = "1432219", k = 3
// Output: "1219"
// Explanation: Remove the three digits 4, 3, and 2 to form the new number 1219 which is the smallest.
//
//
//
// Example 2:
//
// Input: num = "10200", k = 1
// Output: "200"
// Explanation: Remove the leading 1 and the number is 200. Note that the output must not contain leading zeroes.
//
//
//
// Example 3:
//
// Input: num = "10", k = 2
// Output: "0"
// Explanation: Remove all the digits from the number and it is left with nothing which is 0.
//
//
class Solution {
public:
string removeKdigits(string num, int k) {
int times = k;
while (times > 0) {
bool hasFind = false;
for(int i = 0; i < num.size(); i++) {
if ((i + 1) < num.size()) {
if (num[i] > num[i+1] ) {
num.erase(i,1);
times -= 1;
hasFind = true;
break;
}
}
}
if ((!hasFind) && (times > 0)) {
num.erase(num.size() - 1,1);
times -= 1;
}
}
int i = 0;
while (num[i] == '0') {
num.erase(i,1);
}
if (num == "") {
return "0";
}
return num;
}
};