leetcode
不积跬步何以至千里
这个作者很懒,什么都没留下…
展开
-
Reverse Linked List II
描述Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->nullptr, m = 2 and n = 4, return 1->4->3->2->5->nullptr. Note: Given m, n satisfy the原创 2016-08-26 23:44:53 · 464 阅读 · 0 评论 -
Word break
描述: Given a string s and a dictionary of words dict, determine ifs can be segmented into a space-separated sequence of one or more dictionary words.For example, given s = “leetcode”, dict = [“leet”,原创 2016-09-01 23:24:34 · 178 阅读 · 0 评论 -
reverse a linked list
题目Reverse a linked list from position 0 to n-1. For example: Given 1->2->3->4->5->nullptr, return 5->4->3->2->1->nullptr.分析方法1 迭代思路: (1)已知原链表头节点指针head (2)建立一个一个新节点dummy,令其next指针指向head (3)从head开始,原创 2016-08-26 21:23:11 · 578 阅读 · 0 评论 -
Rotate List
描述Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->nullptr and k = 2, return 4->5->1->2->3->nullptr.分析先遍历一遍,得出链表长度len,注意k 可能大于len,因此令k原创 2016-08-27 00:20:08 · 357 阅读 · 0 评论