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 咖啡中不塌缩的方糖 阅读(196) 评论(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 咖啡中不塌缩的方糖 阅读(138) 评论(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 咖啡中不塌缩的方糖 阅读(140) 评论(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 咖啡中不塌缩的方糖 阅读(118) 评论(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 咖啡中不塌缩的方糖 阅读(104) 评论(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 咖啡中不塌缩的方糖 阅读(154) 评论(0) 推荐(0)
349. Intersection of Two Arrays
摘要： Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i 阅读全文
posted @ 2016-09-25 02:35 咖啡中不塌缩的方糖 阅读(232) 评论(0) 推荐(0)