37篇文章 · 8897字 · 3人關(guān)注
-
100. Same Tree (Easy)Description: Given two binary trees, write a function to check if they a...
-
99. Recover Binary Search Tree (Hard)Description: Two elements of a binary search tree (BST) are swapped by m...
-
97. Interleaving String (Hard)Description: Given s1, s2, s3, find whether s3 is formed by the interlea...
-
95. Unique Binary Search Trees II (Medium)Description: Given an integer n, generate all structurally unique BST's ...
-
94/ 144/145. Binary Tree Inorder/Preorder/Postorder Traversal (M/M/H)Description (Inorder, 94): Given a binary tree, return the inorder trave...
-
93. Restore IP Addresses (Medium)
Description: Given a string containing only digits, restore it by return...
-
91. Decode Ways (Medium)
Description: A message containing letters from A-Z is being encoded to n...
-
89. Gray Code (Medium)
Description: The gray code is a binary numeral system where two successi...
-
88. Merge Sorted Array (Easy)
Description: Given two sorted integer arrays nums1 and nums2, merge nums...
