本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss
摘要: 题目链接You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you... 阅读全文
posted @ 2013-12-09 14:25 tenos 阅读(1477) 评论(2) 推荐(1) 编辑
摘要: 题目链接Given an absolute path for a file (Unix-style), simplify it.For example, path = "/home/", => "/home" path = "/a/./b/../../c/", => "/c"Corner Ca... 阅读全文
posted @ 2013-12-09 14:14 tenos 阅读(1241) 评论(1) 推荐(0) 编辑
摘要: 题目链接Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You ha... 阅读全文
posted @ 2013-12-09 14:08 tenos 阅读(972) 评论(0) 推荐(0) 编辑
摘要: 题目链接Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space? A straight forward... 阅读全文
posted @ 2013-12-09 13:49 tenos 阅读(843) 评论(0) 推荐(0) 编辑
摘要: LeetCode:Search in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5... 阅读全文
posted @ 2013-12-09 13:32 tenos 阅读(2063) 评论(0) 推荐(0) 编辑

本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss

公益页面-寻找遗失儿童