bug睡的略爽

摘要： Divide two integers without using multiplication, division and mod operator. 方法一：暴力破解，不断用被除数减去除数，直至出现负数停止，铁定超时。 方法二：对方法一的改进，每次寻找 满足2k-1 * 除数 <= 被除数 < 阅读全文

摘要： Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space fo 阅读全文

摘要： Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then l 阅读全文

摘要： Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your a 阅读全文

摘要： Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 方法一：暴力破解，1和2合并，合并后再和3合并，合并后再和4合并。。。如此下去一直将所有链表节点全部合 阅读全文