fantow的博客

Largest Number Given a list of non negative integers, arrange them such that they form the largest number. 时间复杂度:O(n^2) 空间复杂度:O(n) public String largestNumber(int[] nums) { int length = nums.l...

Wiggle Sort II Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]… 时间复杂度:O(n*logn) 空间复杂度:O(n) 将排序后的数组分为前后两部分，每次从两部分中拿出当前最大的，按顺序放入temp数组 public void wiggl...

Sort Colors Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will...