摘要：
Given a non-negative integernum, repeatedly add all its digits until the result has only one digit. For example: Givennum = 38, the process is like:3 阅读全文
2017年9月26日
摘要：
Given a non-negative integernum, repeatedly add all its digits until the result has only one digit. For example: Givennum = 38, the process is like:3 阅读全文
摘要：
Given two stringssandtwhich consist of only lowercase letters. Stringtis generated by random shuffling stringsand then add one more letter at a random 阅读全文
摘要：
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target. E 阅读全文
摘要：
Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements. For example, given 阅读全文
摘要：
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep 阅读全文
摘要：
Given an m * n matrixMinitialized with all0's and several update operations. Operations are represented by a 2D array, and each operation is represent 阅读全文
摘要：
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 阅读全文
摘要：
Given anon-emptyinteger array of sizen, find the minimum number of moves required to make all array elements equal, where a move is incrementingn- 1 e 阅读全文
