题目链接
https://leetcode-cn.com/problems/n-th-tribonacci-number/
题目解析
Golang
1 | func tribonacci(n int) int { |
https://leetcode-cn.com/problems/n-th-tribonacci-number/
1 | func tribonacci(n int) int { |
https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/
1 | /** |
https://leetcode-cn.com/problems/linked-list-cycle/
该题是面试常考题型,以前好友面字节游戏引擎岗的时候专门考过。
https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
1 | /** |
开始这篇文章之前,我特别查了learn
和study
的区别,虽然两者都表示学习,但当我查了learn 和study有什么区别?的结果后,决定用learn
,因为我们学习算法肯定是要学有所得,而不是重视学算法的过程!