2017年1月9日
Partition Array
摘要： Given an array nums of integers and an int k, partition the array (i.e move the elements in "nums") such that: All elements < k are moved to the left 阅读全文
posted @ 2017-01-09 10:17 璨璨要好好学习 阅读(111) 评论(0) 推荐(0) 编辑
Two Sum
摘要： Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two n 阅读全文
posted @ 2017-01-09 08:59 璨璨要好好学习 阅读(127) 评论(0) 推荐(0) 编辑
Lintcode Subarray Sum Closest
摘要： Given an integer array, find a subarray with sum closest to zero. Return the indexes of the first number and last number. Example Given [-3, 1, 1, -3, 阅读全文
posted @ 2017-01-09 06:19 璨璨要好好学习 阅读(128) 评论(0) 推荐(0) 编辑