Advertisement
Guest User

Untitled

a guest
Oct 20th, 2019
233
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.40 KB | None | 0 0
  1. class Solution {
  2. public String solution(String number, int k) {
  3.  
  4. String answer = "";
  5. int resultStringNum = number.length() - k; //총 자리수
  6. char maxNum ='0'; //숫자비교 char
  7. int maxNumIndex =0; //
  8. int middle = k+1; // 최대로 삭제가능한 자리수
  9.  
  10. if(number.length()==k) //삭제 수가 같으면 0 return
  11. return "0";
  12.  
  13. while(true)
  14. {
  15. for(int i=0; i<middle; i++)//까지 가장큰수를 찾음
  16. {
  17. if(number.charAt(i)>maxNum)
  18. {
  19. maxNum = number.charAt(i);
  20. maxNumIndex = i;
  21. }
  22. }
  23. number = number.substring(maxNumIndex+1,number.length()); //substring
  24. middle -= maxNumIndex;
  25.  
  26. // if(middle<number.length())
  27. // {
  28. // middle = number.length();
  29. // }
  30.  
  31. k -= maxNumIndex; //제거한애만큼 k를 빼주고
  32. answer += (maxNum+"");
  33. maxNumIndex =0;
  34. maxNum ='0'; //초기화
  35.  
  36. if(answer.length()==resultStringNum)
  37. {
  38. break;
  39. }
  40.  
  41. if(k==0)
  42. {
  43. answer += number;
  44. break;
  45. }
  46. }
  47.  
  48. return answer;
  49. }
  50. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement