摘要:
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.思路:首先想到的机试不断地减去一个数直到0为止,但是这样得复杂度为O(n),只得... 阅读全文
摘要:
1、windows中切换目录中有空格可以直接切换,但是Linux中需要使用转义例如要切换到/root/src test/命令:cd src\ test使用反斜杠转义后面再加上空格就可以啦2、如果执行$NDK/ndk-build出现/ndk-build: No such file or directo... 阅读全文
摘要:
Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor... 阅读全文
摘要:
Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文
摘要:
Letter Combinations of a Phone NumberGiven a digit string, return all possible letter combinations that the number could represent.A mapping of digit ... 阅读全文