摘要：
Total Accepted:73922Total Submissions:269855Difficulty:MediumImplement pow(x,n).(M) Sqrt(x)1.递归/*n = 0, 0x = 0 ,x>0,x>1) ; res = res * res; ... 阅读全文
摘要：
otal Accepted:54356Total Submissions:357733Difficulty:MediumDivide two integers without using multiplication, division and mod operator.If it is overf... 阅读全文
摘要：
Total Accepted:111287Total Submissions:474471Difficulty:EasyReverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321cli... 阅读全文
摘要：
Total Accepted:48185Total Submissions:241794Difficulty:HardGiven a string S and a string T, find the minimum window in S which will contain all the ch... 阅读全文
摘要：
Total Accepted:45534Total Submissions:226763Difficulty:HardYou are given a string,s, and a list of words,words, that are all of the same length. Find ... 阅读全文
摘要：
Total Accepted:53943Total Submissions:209664Difficulty:HardA linked list is given such that each node contains an additional random pointer which coul... 阅读全文