曾繁辉Hank

Givenanarrayofcitations(eachcitationisanon-negativeinteger)ofaresearcher,writeafunctiontocomputether

50.Pow(x,n)Medium16363162AddtoListShareImplementpow(x,n),whichcalculatesxraisedtothepowern(xn).Examp

Mergeksortedlinkedlistsandreturnitasonesortedlist.Analyzeanddescribeitscomplexity.Example:Solution

Given a string, find the length of the longest substring without repeating characters. Creat a dictionary window = {char : pos} to record t…

Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes th…