原文:[LeetCode] 670. Maximum Swap 最大置换

Given a non negative integer, you could swap two digitsat mostonce to get the maximum valued number. Return the maximum valued number you could get. Example : Example : Note: The given number is in t ...

2017-09-24 01:29 4 6245 推荐指数:

查看详情

[LeetCode] 164. Maximum Gap 求最大间距

Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Return 0 if the array contains less than ...

Tue Jan 20 06:49:00 CST 2015 12 10534
 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM