halfrost / LeetCode-Go

✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% / LeetCode 题解
https://books.halfrost.com/leetcode
MIT License
32.98k stars 5.7k forks source link

Update 0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversa… #163

Closed karminski closed 3 years ago

karminski commented 3 years ago

…l.md

UPDATE a new answer for less memory cost & FIX method name typo.