- 博客(3)
- 收藏
- 关注
原创 Leetcode 111. Minimum Depth of Binary Tree
Leetcode 111. Minimum Depth of Binary Tree 题目: Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Note:A leaf is a node with no children. ..
2020-11-07 18:56:51
126
原创 Leetcode 1. Two Sum
Leetcode1.Two Sum 题目: Given an array of integersnumsand an integertarget, returnindices of the two numbers such that they add up totarget. You may assume that each input would haveexactlyone solution, and you may not use thesameelement twice....
2020-11-07 13:20:31
143
转载 开始的开始
【摘抄】最low的学习,就是“听别人讲“,然后是自己闭门读书,再然后看视频,看别人的演示,这些都是被动学习。只在主动找人讨论、践行,传播教会他人才是主动学习! 所以,订阅像“得到“或是“极客时间“这样的专栏,都是比较low的学习方式,没有比看书好到哪里,只要你们不讨论,你们不践行,不教会别人,你们只会有一种勤奋努力的幻觉——就好像看微信公众号一样,看似阅读量很大,感觉自己进步了,但是其实只是一种错...
2018-11-26 22:17:19
104
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人