LeetCode Remove K Digits

原题链接在这里：https://leetcode.com/problems/remove-k-digits/description/

题目：

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.

题解：

利用stack 保存从头到尾iterate input num string的char, 若当前char 比stack顶小就一直pop栈顶直到去掉的数等于k了或者栈顶的元素更小.

然后从头到尾找到第一个非0的位置往后扫剩余digit长度的char.

扫过的0也应该count在剩余digit长度中，只不过不会显示在结果string里.

Time Complexity: O(n). n = num.length().

Space: O(n).

AC Java:

 1 class Solution {
 2     public String removeKdigits(String num, int k) {
 3         if(num == null || num.length() == 0){
 4             return num;
 5         }
 6
 7         int len = num.length();
 8         int remainDigits = len-k;
 9         char [] stk = new char[len];
10         int top = 0;
11         for(int i = 0; i<len; i++){
12             char c = num.charAt(i);
13             while(top>0 && c<stk[top-1] && k>0){
14                 top--;
15                 k--;
16             }
17
18             stk[top++] = c;
19         }
20
21         // 找到第一个不为0的index
22         int ind = 0;
23         while(ind<remainDigits && stk[ind]=='0'){
24             ind++;
25         }
26         return ind == remainDigits ? "0" : new String(stk, ind, remainDigits-ind);
27     }
28 }

类似Create Maximum Number.

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/8327380.html

LeetCode Remove K Digits相关推荐

[LeetCode] 402. Remove K Digits Java
题目: Given a non-negative integer num represented as a string, remove k digits from the number so tha ...
leetcode 402. Remove K Digits | 402. 移掉 K 位数字（单调栈）
题目 https://leetcode.com/problems/remove-k-digits/ 题解本题考察对问题的抽象能力,多写几个例子可以发现,这是一个单调栈问题,维护一个单调不减栈. cl ...
leetcode算法题--Remove K Digits
原题链接:https://leetcode.com/problems/remove-k-digits/ string removeKdigits(string num, int k) {string ...
贪心：remove K digits移除K个数字
问题描述: 已知一个使用字符串表示的非负整数num,将num中的k个数字移除,求移除k个数字后,可以获得的最小的可能的新数字. 例如:num = "1432219" , k = ...
LeetCode-Remove K Digits
题目 Remove K Digits Given a non-negative integer num represented as a string, remove k digits from th ...
LeetCode:Remove Duplicates from Sorted List I II
LeetCode:Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such t ...
LeetCode 787. K 站中转内最便宜的航班（图/Bellman Ford算法）
文章目录贝尔曼-福特算法(Bellman-Ford) 简介算法思想算法执行过程应用题目描述分析代码 LeetCode 787. K 站中转内最便宜的航班题目描述 Bellman For ...
LeetCode——787. K 站中转内最便宜的航班(Cheapest Flights Within K Stops)[中等]——分析及代码（Java）
LeetCode--787. K 站中转内最便宜的航班[Cheapest Flights Within K Stops][中等]--分析及代码[Java] 一.题目二.分析及代码 1. 动态规划 ( ...
LeetCode 787.K站中转内最便宜的航班
LeetCode 787.K站中转内最便宜的航班有 n 个城市通过 m 个航班连接.每个航班都从城市 u 开始,以价格 w 抵达 v. 现在给定所有的城市和航班,以及出发城市 src 和目的地 ds ...

LeetCode Remove K Digits

LeetCode Remove K Digits相关推荐

最新文章

热门文章