LeetCode
文章平均质量分 72
L花自飘零
https://github.com/CodeforL
展开
-
Convert BST to Greater Tree
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 keys greater than the original key in BST.Exampl原创 2017-09-22 19:15:56 · 148 阅读 · 0 评论 -
LeetCode -- Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like:3 + 8 = 11, 1 + 1 = 2. Since 2 has only one原创 2017-09-20 23:32:13 · 146 阅读 · 0 评论 -
Minimum Absolute Difference in BST
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.Example:Input: 1 \ 3 / 2Output:1Explanation:Th原创 2017-10-07 21:08:01 · 170 阅读 · 0 评论 -
Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Coul原创 2017-09-21 18:45:19 · 137 阅读 · 0 评论 -
Construct the Rectangle
For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L原创 2017-09-30 21:41:11 · 174 阅读 · 0 评论 -
Intersection of Two Arrays
Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element in the result must be unique.原创 2017-10-01 12:28:38 · 207 阅读 · 0 评论