摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Y 阅读全文
posted @ 2019-01-28 13:22
Schwifty
阅读(165)
评论(0)
推荐(0)
摘要：
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the thr 阅读全文
posted @ 2019-01-28 11:16
Schwifty
阅读(124)
评论(0)
推荐(0)
摘要：
class Solution { public List<List<Integer>> threeSum(int[] nums) { Arrays.sort(nums); List<List<Integer>> res = new ArrayList(); for(int i = 0; i < nu 阅读全文
posted @ 2019-01-28 10:02
Schwifty
阅读(172)
评论(0)
推荐(0)
摘要：
leetcode 21道 前端从放弃到入门 p1-p20 阅读全文
posted @ 2019-01-28 06:13
Schwifty
阅读(138)
评论(0)
推荐(0)
摘要：
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 or 阅读全文
posted @ 2019-01-28 02:51
Schwifty
阅读(137)
评论(0)
推荐(0)
浙公网安备 33010602011771号