咖啡中不塌缩的方糖

2016年9月26日

摘要： Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the conditionnums[i] + 阅读全文

posted @ 2016-09-26 07:55 咖啡中不塌缩的方糖阅读(110) 评论(0) 推荐(0) 编辑

86. Partition List

摘要： Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文

posted @ 2016-09-26 01:22 咖啡中不塌缩的方糖阅读(110) 评论(0) 推荐(0) 编辑

209. Minimum Size Subarray Sum

摘要： Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 阅读全文

posted @ 2016-09-26 01:21 咖啡中不塌缩的方糖阅读(126) 评论(0) 推荐(0) 编辑

11. Container With Most Water

摘要： Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo 阅读全文

posted @ 2016-09-26 00:12 咖啡中不塌缩的方糖阅读(107) 评论(0) 推荐(0) 编辑

2016年9月25日

360. Sort Transformed Array

摘要： Given a sorted array of integers nums and integer values a, b and c. Apply a function of the form f(x) = ax2 + bx + c to each element x in the array. 阅读全文

posted @ 2016-09-25 06:28 咖啡中不塌缩的方糖阅读(168) 评论(0) 推荐(0) 编辑

16. 3Sum Closest

摘要： Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. 阅读全文

posted @ 2016-09-25 05:55 咖啡中不塌缩的方糖阅读(114) 评论(0) 推荐(0) 编辑

345. Reverse Vowels of a String

摘要： Write a function that takes a string as input and reverse only the vowels of a string. Example 1:Given s = "hello", return "holle". Example 2:Given s 阅读全文

posted @ 2016-09-25 03:38 咖啡中不塌缩的方糖阅读(120) 评论(0) 推荐(0) 编辑

350. Intersection of Two Arrays II

摘要： Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. Note: Each elemen 阅读全文

posted @ 2016-09-25 03:13 咖啡中不塌缩的方糖阅读(104) 评论(0) 推荐(0) 编辑

27. Remove Element

摘要： Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you 阅读全文

posted @ 2016-09-25 03:05 咖啡中不塌缩的方糖阅读(86) 评论(0) 推荐(0) 编辑

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, giv 阅读全文

posted @ 2016-09-25 02:41 咖啡中不塌缩的方糖阅读(133) 评论(0) 推荐(0) 编辑

咖啡中不塌缩的方糖

公告