[LeetCode]Construct Binary Tree from Inorder and Postorder Traversal

和 Construct Binary Tree from Inorder and Postorder Traversal 是类似的。

O(n log n):

O(n)：