Topcoder SRM 583 DIV2 SwappingDigits
2013-06-19 09:05
337 查看
题目题意是交换一次,使数字最小,且数字前面不能有前导0
string minNumber(string num) { string res = num; for(int i = 0 ; i < num.size(); i ++ ){ for(int j = i + 1; j < num.size(); j ++ ){ if(i == 0 && num[j] == '0') continue; else{ swap(num[i],num[j]); res = res > num ? num : res; swap(num[i],num[j]); } } } return res; }
相关文章推荐
- 记第一次TopCoder, 练习SRM 583 div2 250
- SRM 583 Div II Level One:SwappingDigits
- Topcoder SRM 583 DIV2 解题报告
- Topcoder SRM 583 DIV2 解题报告
- topcoder SRM 639 div2
- topcoder SRM 666 DIV2 CollectingTokens 树形dp
- TopCoder SRM 612 DIV1 900
- topcoder srm 687 div1
- TopCoder SRM 144 DIV1 BinaryCode
- 小朋友学TopCoder(5):SRM144 DIV1 550-point
- TopCoder——SRM 520 DIV 2
- TopCoder 300 points 1-SRM 144 DIV 1 90/300 30%
- TopCoder SRM 645 Div2 Problem 500 - ConnectingCars (枚举)
- 小朋友学TopCoder(8):SRM726 DIV2 500-point
- topcoder srm 520 div1
- Topcoder SRM 584 DIV2 解题报告
- Topcoder Srm 649 DIV1
- topcoder SRM 610 DIV2 DivideByZero
- TopCoder SRM 653 Div2 Problem 500 - RockPaperScissorsMagicEasy (DP)
- 求拓扑排序的数量,例题 topcoder srm 654 div2 500