摘要:
Given an integer array, find a subarray with sum closest to zero. Return the indexes of the first number and last number.Have you met this question in... 阅读全文
摘要:
iven a root of Binary Search Tree with unique value for each node. Remove the node with given value. If there is no such a node with given value in t... 阅读全文
摘要:
Given an array of integers and a number k, the majority number is the number that occurs more than 1/k of the size of the array.Find it.Have you met t... 阅读全文