2015年6月16日
LeetCode之“数学”：Reverse Integer && Reverse Bits
摘要： 1.Reverse Integer 题目链接 题目要求： Reverse digits of an integer. Example1:x = 123, return 321 Example2:x = -123, return -321 click to show spoilers.... 阅读全文
posted @ 2015-06-16 22:42 峰子_仰望阳光 阅读(351) 评论(0) 推荐(0)
LeetCode之“动态规划”：Distinct Subsequences
摘要： 题目链接 题目要求： Given a stringSand a stringT, count the number of distinct subsequences ofTinS. A subsequence of a string is a new string which is for... 阅读全文
posted @ 2015-06-16 17:06 峰子_仰望阳光 阅读(183) 评论(0) 推荐(0)
LeetCode之“动态规划”：Scramble String
摘要： 题目链接 题目要求： Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possib... 阅读全文
posted @ 2015-06-16 14:40 峰子_仰望阳光 阅读(319) 评论(0) 推荐(0)
LeetCode之“动态规划”：Edit Distance
摘要： 题目链接 题目要求： Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)　... 阅读全文
posted @ 2015-06-16 10:21 峰子_仰望阳光 阅读(440) 评论(0) 推荐(0)