-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay 13 Remove K Digits.cpp
73 lines (51 loc) · 1.49 KB
/
Day 13 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
72
73
PROBLEM:
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.
SOLUTION:
class Solution {
public:
string removeKdigits(string num, int k) {
int i;
string s;
if(k==0)
return num;
if(k>=num.length())
{
s="0";
return s;
}
for (const auto c : num) {
while (k > 0 && !s.empty() && s.back() > c) {
s.pop_back();
k--;
}
s.push_back(c);
}
s.resize(s.length() - k);
for(i=0;i<s.length();i++)
{
if(s[i]!='0')
{
break;
}
}
s=s.substr(i,s.length()-i);
if(s.empty())
s="0";
return s;
}
};