花费 26 ms
Leetcode: Create Maximum Number

We can use greedy method to solve this. num1 can take charge of i(0<=i<=k) numbers and ...

Sat Jan 02 18:17:00 CST 2016 0 2686

 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM