큰 수 만들기

Java

import java.util.*;
class Solution {
    char[] numberArr;
    int start;
    int end;
    public String solution(String number, int k) {
        String answer = "";
        numberArr = number.toCharArray();
        start = 0;
        int remainCount = numberArr.length - k;
        while(answer.length() < numberArr.length - k){
        	end = numberArr.length - remainCount;
            answer += number();
            remainCount--;
        }
        
        return answer;
    }
    private int number(){
        int max = 0;
        int endLength = end;
        for(int i = start; i <= endLength; i++){
            if(max == 9)
                break;
            if(max < numberArr[i] - '0'){
                max = numberArr[i] - '0';
                start = i + 1;
                
            }
        }
        return max;
    }
}

Python

def solution(number, k):
    answer = ''
    start = 0
    end = 0
    numberArr = [int(i) for i in number]
    remainCount = len(number) - k
    while(len(answer) < len(number) - k):
        end = len(number) - remainCount
        maxNum = -1
        for i in range(start, end + 1, 1):
            if maxNum == 9:
                break
            if maxNum < numberArr[i]:
                maxNum = numberArr[i]
                start = i + 1
        answer += str(maxNum)
        remainCount -= 1
    
    return answer