leetcode 402. Remove K Digits

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.

Subscribe to see which companies asked this question.

    public String removeKdigits(String num, int k) {
        if (k >= num.length()) {
            return "0";
        }
        int len = k;
        LinkedList<Character> list = new LinkedList<>();
        for (int i = 0; i < num.length(); i++) {
            list.add(num.charAt(i));
        }
        for (int j = 1; j < list.size() && k > 0; j++) {
            if (list.size() == 1 || list.size() == 0) {
                return "0";
            }
            if (list.get(j - 1) > list.get(j)) {
                list.remove(j - 1);
                j--;
                if(j>0){
                    j--;
                }
                k--;
            }
            if (j == list.size() - 1&&k>0) {
                for(int i=0;i<k;i++){
                    list.remove(list.size()-1);
                }
                break;
            }
        }
        for (int i = 0; i < list.size(); i++) {
            if (list.get(i) != '0') {
                break;
            }
            list.remove(i);
            i--;
        }
        String str = "";
        if (list.size() == 0) return "0";
        for (int i = 0; i < list.size(); i++) {
            str = str + list.get(i) + "";
        }
        return str;
    }