leetcode
雪不化花不开
这个作者很懒,什么都没留下…
展开
-
leetcode 第5题回数
1.题目描述Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad" Output: "bab" Note: "aba" is also a valid answer. Exa...原创 2018-03-11 22:03:25 · 365 阅读 · 0 评论 -
剑指offer:重建二叉树
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; *//*整体的思想, 通过观察前序遍历和中序遍...原创 2018-06-13 22:21:40 · 142 阅读 · 0 评论