algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-04 16:12:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix go report card

Browse Source
This commit is contained in:
YDZ
2020-09-30 10:47:46 +08:00
parent c1f421273b
commit 3e7996d371
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree/README.md
View File

@ -28,3 +28,4 @@ One possible answer is: [0,-3,9,-10,null,5], which represents the following heig
## 解题思路
思路比较简单，依次把链表的中间点作为根结点，类似二分的思想，递归排列所有结点即可。