Sort
liujunlovecs
这个作者很懒,什么都没留下…
展开
-
Leetcode#56||Merger Intervals
/** * Definition for an interval. * public class Interval { * int start; * int end; * Interval() { start = 0; end = 0; } * Interval(int s, int e) { start = s; end = e; } * } */原创 2015-08-17 15:09:16 · 214 阅读 · 0 评论 -
Leetcode#57||Insert Interval
/** * Definition for an interval. * public class Interval { * int start; * int end; * Interval() { start = 0; end = 0; } * Interval(int s, int e) { start = s; end = e; } * } */原创 2015-08-17 15:42:29 · 240 阅读 · 0 评论 -
Leetcode#75||Sort Colors
public class Solution { public void sortColors(int[] nums) { if (nums == null || nums.length < 2) { return; } int length = nums.length;原创 2015-08-19 14:03:30 · 303 阅读 · 0 评论