- 博客(3)
- 收藏
- 关注
RSS订阅原创 leetcode 280
Leetcode 280. Wiggle Sort Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3]… Example: Input: nums = [3,5,2,1,6,4] Output: One possible answe...
2019-07-02 22:35:25
219
原创 Leetcode 179
leetcode 179. Largest Number class Solution { public String largestNumber(int[] nums) { if(nums == null || nums.length == 0) return ""; StringBuilder sb = new StringBui...
2019-07-01 21:33:50
113
原创 leetcode56
Leetcode 56. Merge Intervals Given a collection of intervals, merge all overlapping intervals. Example 1: Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since interval...
2019-07-01 20:47:19
125
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人