摘要：
Problem:Implement a basic calculator to evaluate a simple expression string.The expression string contains onlynon-negativeintegers,+,-,*,/operators a... 阅读全文
摘要：
Problem:Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible repres... 阅读全文
摘要：
Problem:Given an unsorted arraynums, reorder itin-placesuch thatnums[0] = nums[2] = nums[2] = nums[i+1]Note: i is an odd number. Solution 1:public cla... 阅读全文
摘要：
Problem:Given a non-empty binary search tree and a target value, findkvalues in the BST that are closest to the target.Note:Given target value is a fl... 阅读全文