2015年7月25日

17.Letter Combinations of a Phone Number(Back-Track)

摘要: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文

posted @ 2015-07-25 21:48 joannae 阅读(259) 评论(0) 推荐(0) 编辑

16.3Sum Closest (Two-Pointers)

摘要: Given an arraySofnintegers, find three integers inSsuch that the sum is closest to a given number, target. Return the sum of the three integers. You m... 阅读全文

posted @ 2015-07-25 15:47 joannae 阅读(164) 评论(0) 推荐(0) 编辑

15.3Sum (Two-Pointers)

摘要: Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of 阅读全文

posted @ 2015-07-25 06:48 joannae 阅读(160) 评论(0) 推荐(0) 编辑

导航