题目描述 Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Gi…
分类:Leetcode
[leetcode]roman to integer(罗马数字转整数)
题目描述 Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. 题目解析 罗马数…
[leetcode]Same Tree
题目描述 Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if…
[leetcode]populating next right pointers in each node
题目描述 题目描述 Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Popul…
[Leetcode]copy list with random pointer
题目描述 A linked list is given such that each node contains an additional random pointer which could point to any node in t…