Fork me on GitHub
摘要: 题目:Reverse a singly linked list.提示:此题不难,可以用迭代或者递归两种方法求解。记得要把原来的链表头的next置为NULL;代码:迭代:/** * Definition for singly-linked list. * struct ListNode { * ... 阅读全文
posted @ 2015-09-10 16:45 __Neo 阅读(103) 评论(0) 推荐(0) 编辑
摘要: 题目:Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: ... 阅读全文
posted @ 2015-09-10 11:55 __Neo 阅读(158) 评论(0) 推荐(0) 编辑
摘要: 题目:Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as00000010100101000001111010011100), retu... 阅读全文
posted @ 2015-09-10 11:13 __Neo 阅读(117) 评论(0) 推荐(0) 编辑