2015年1月21日
【leetcode】Word Ladder II（hard）★ 图 回头看
摘要： Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be changed... 阅读全文
posted @ 2015-01-21 22:58 匡子语 阅读(222) 评论(0) 推荐(0)
【leetcode】Permutations II (middle)
摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm... 阅读全文
posted @ 2015-01-21 21:22 匡子语 阅读(173) 评论(0) 推荐(0)
【leetcode】Combination Sum II (middle) ☆
摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文
posted @ 2015-01-21 15:17 匡子语 阅读(202) 评论(0) 推荐(0)
【leetcode】Combination Sum (middle)
摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文
posted @ 2015-01-21 14:08 匡子语 阅读(177) 评论(0) 推荐(0)