动态规划leetcode 70 爬楼梯func climbStairs(n int) int { if n <= 1 { return 1 } dp := make([]int, n+1) dp[0] = 1 dp[1] = 1 for i :

用递归，递归获取左右两树的根节点，然后替换左右两子树/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode *

https://leetcode.cn/problems/palindrome-linked-list/description/?envType=problem-list-v2&envId=2cktkvj双指针，一个往后读一个往前读，如果不一样就false，否则就是回文链表/** * Def

https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/description/?envType=problem-list-v2&envId=2cktkvj解题思路：利用深度优先搜索，把所有节点的父节点存入pa

https://leetcode.cn/problems/intersection-of-two-linked-lists/description/?envType=problem-list-v2&envId=2cktkvj双指针法https://leetcode.cn/problems/i