摘要: Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Note:Do not modify the linked list.F... 阅读全文
posted @ 2015-08-30 21:17 `Liok 阅读(319) 评论(0) 推荐(0) 编辑
摘要: Linked List CycleGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?https://leetcode.com/prob... 阅读全文
posted @ 2015-08-30 21:14 `Liok 阅读(404) 评论(0) 推荐(0) 编辑
摘要: Integer to RomanGiven an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.https://leetcode.com/problem... 阅读全文
posted @ 2015-08-30 16:20 `Liok 阅读(405) 评论(0) 推荐(0) 编辑
摘要: Roman to IntegerGiven a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.https://leetcode.com/problem... 阅读全文
posted @ 2015-08-30 00:40 `Liok 阅读(523) 评论(0) 推荐(0) 编辑