摘要: Swap Nodes in PairsGiven a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2-... 阅读全文
posted @ 2014-12-19 16:10 陆草纯 阅读(301) 评论(0) 推荐(0) 编辑
摘要: Reverse Nodes in k-GroupGiven a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a... 阅读全文
posted @ 2014-12-19 16:02 陆草纯 阅读(426) 评论(0) 推荐(0) 编辑
摘要: Divide Two IntegersDivide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.不能用乘法,我们可以移位啊,移p位就相当于... 阅读全文
posted @ 2014-12-19 15:37 陆草纯 阅读(3839) 评论(0) 推荐(1) 编辑