Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public String solution(String number, int k) {
- String answer = "";
- int resultStringNum = number.length() - k; //총 자리수
- char maxNum ='0'; //숫자비교 char
- int maxNumIndex =0; //
- int middle = k+1; // 최대로 삭제가능한 자리수
- if(number.length()==k) //삭제 수가 같으면 0 return
- return "0";
- while(true)
- {
- for(int i=0; i<middle; i++)//까지 가장큰수를 찾음
- {
- if(number.charAt(i)>maxNum)
- {
- maxNum = number.charAt(i);
- maxNumIndex = i;
- }
- }
- number = number.substring(maxNumIndex+1,number.length()); //substring
- middle -= maxNumIndex;
- // if(middle<number.length())
- // {
- // middle = number.length();
- // }
- k -= maxNumIndex; //제거한애만큼 k를 빼주고
- answer += (maxNum+"");
- maxNumIndex =0;
- maxNum ='0'; //초기화
- if(answer.length()==resultStringNum)
- {
- break;
- }
- if(k==0)
- {
- answer += number;
- break;
- }
- }
- return answer;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement