2015年4月6日

Word Ladder

摘要： Given two words (startandend), and a dictionary, find all transformation sequence(s) fromstarttoend, such that:Only one letter can be changed at a tim... 阅读全文

posted @ 2015-04-06 09:49 Step-BY-Step 阅读(262) 评论(0) 推荐(0) 编辑

Binary Tree Right Side View

摘要： Given a binary tree, imagine yourself standing on therightside of it, return the values of the nodes you can see ordered from top to bottom.For exampl... 阅读全文

posted @ 2015-04-06 06:05 Step-BY-Step 阅读(271) 评论(0) 推荐(0) 编辑

House Robber

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo... 阅读全文

posted @ 2015-04-06 05:55 Step-BY-Step 阅读(147) 评论(0) 推荐(0) 编辑

导航