the java code is not able to take last test case as input

前端 未结 0 1937
星月不相逢
星月不相逢 2021-02-01 04:29

Given a number K and string S of digits denoting a positive integer, build the largest number possible by performing swap operations on the digits of S atmost K times.

         


        
相关标签:
回答
  • 消灭零回复
提交回复
热议问题