- 博客(2)
- 收藏
- 关注
原创 Leetcode--283. Move Zeroes
题目Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your fun
2017-09-30 16:01:27 369
原创 Leetcode--670. Maximum Swap
题目Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get.Example 1: Input: 2736 Output: 7236 Explanatio
2017-09-04 21:31:59 1348
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人