摘要：
Design a HashMap without using any built in hash table libraries. To be specific, your design should include these functions: put(key, value) : Insert 阅读全文
posted @ 2018-10-24 22:03
bernieloveslife
阅读(219)
评论(0)
推荐(0)
摘要：
We are given two strings, A and B. A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, 阅读全文
posted @ 2018-10-24 22:03
bernieloveslife
阅读(91)
评论(0)
推荐(0)
摘要：
X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. Each digit must be rotate 阅读全文
posted @ 2018-10-24 22:03
bernieloveslife
阅读(141)
评论(0)
推荐(0)
摘要：
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Exa 阅读全文
posted @ 2018-10-24 22:02
bernieloveslife
阅读(120)
评论(0)
推荐(0)
摘要：
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all 阅读全文
posted @ 2018-10-24 22:02
bernieloveslife
阅读(135)
评论(0)
推荐(0)
浙公网安备 33010602011771号