leedcode
fordushao
这个作者很懒,什么都没留下…
展开
-
递归----第 N 个泰波那契数
递归----第 N 个泰波那契数题目泰波那契序列 Tn 定义如下:T0 = 0, T1 = 1, T2 = 1, 且在 n >= 0 的条件下 Tn+3 = Tn + Tn+1 + Tn+2给你整数 n,请返回第 n 个泰波那契数 Tn 的值。示例 1:输入:n = 4输出:4解释:T_3 = 0 + 1 + 1 = 2T_4 = 1 + 1 + 2 = 4示例 2:...原创 2020-02-08 17:02:52 · 595 阅读 · 0 评论 -
LeetCode-----把'O'变成'X'
LeetCode—–把’O’变成’X’注:思路和代码是参考牛客上Ron大神的,自己没有写出来。。。 Given a 2D board containing’X’and’O’, capture all regions surrounded by’X’. A region is captured by flipping all’O’s into’X’s in that surrounded regi原创 2017-08-29 16:40:42 · 500 阅读 · 0 评论 -
LeetCode-----回文串分割
回文串分割Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s =”aab”, Return [ [“aa”,”原创 2017-08-29 15:17:11 · 261 阅读 · 0 评论 -
LeetCode-----回文串的最小分割
Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning of s. For example, given s =”aab”, Return1since原创 2017-08-29 10:17:51 · 569 阅读 · 0 评论