Ying

个人博客:http://smartsi.club/

[LeetCode]143.Reorder List

【题目】 Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' v...

2014-01-31 23:05:04

阅读数:1760

评论数:0

LeetCode之Reorder List

【题目】 Given a singly linked listL:L0→L1→…→Ln-1→Ln, reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes...

2014-01-31 23:05:00

阅读数:0

评论数:0

[LeetCode]143.Reorder List

【题目】 Given a singly linked listL:L0→L1→…→Ln-1→Ln, reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes...

2014-01-31 23:05:00

阅读数:1

评论数:0

[LeetCode]141.Linked List Cycle

【题目】 Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 【题意】 给定一个链表,确定它是否包含一个环。 【分析】 ...

2014-01-31 17:46:32

阅读数:1956

评论数:0

LeetCode之Linked List Cycle

【题目】 Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 【题意】 给定一个链表,确定它是否包含一个环...

2014-01-31 17:46:00

阅读数:1

评论数:0

[LeetCode]141.Linked List Cycle

【题目】 Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 【题意】 给定一个链表,确定它是否包含一个环...

2014-01-31 17:46:00

阅读数:1

评论数:0

[LeetCode]25.Reverse Nodes in k-Group

【题目】 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...

2014-01-31 11:04:54

阅读数:1970

评论数:0

LeetCode之Reverse Nodes in k-Group

【题目】 Given 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 multiple...

2014-01-31 11:04:00

阅读数:1

评论数:0

[LeetCode]25.Reverse Nodes in k-Group

【题目】 Given 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 multiple...

2014-01-31 11:04:00

阅读数:1

评论数:0

[LeetCode]24.Swap Nodes in Pairs

【题目】 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...

2014-01-29 17:02:41

阅读数:1701

评论数:0

[LeetCode]24.Swap Nodes in Pairs

【题目】 Given a linked list, swap every two adjacent nodes and return its head. For example, Given1->2->3->4, ...

2014-01-29 17:02:00

阅读数:1

评论数:0

[LeetCode]24.Swap Nodes in Pairs

【题目】 Given a linked list, swap every two adjacent nodes and return its head. For example, Given1->2->3->4, ...

2014-01-29 17:02:00

阅读数:1

评论数:0

[LeetCode]19.Remove Nth Node From End of List

【题目】 Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->...

2014-01-29 14:39:25

阅读数:1716

评论数:0

LeetCode之Remove Nth Node From End of List

【题目】 Given a linked list, remove thenthnode from the end of list and return its head. For example, Given linked list: 1->2-&am...

2014-01-29 14:39:00

阅读数:1

评论数:0

[LeetCode]19.Remove Nth Node From End of List

【题目】 Given a linked list, remove thenthnode from the end of list and return its head. For example, Given linked list: 1->2-&am...

2014-01-29 14:39:00

阅读数:1

评论数:0

[LeetCode]61.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->NULL and k ...

2014-01-29 14:04:26

阅读数:2036

评论数:0

LeetCode之Rotate List

【题目】 Given a list, rotate the list to the right bykplaces, wherekis non-negative. For example: Given1->2->3-&g...

2014-01-29 14:04:00

阅读数:1

评论数:0

[LeetCode]61.Rotate List

【题目】 Given a list, rotate the list to the right bykplaces, wherekis non-negative. For example: Given1->2->3-&g...

2014-01-29 14:04:00

阅读数:2

评论数:0

[LeetCode]82.Remove Duplicates from Sorted List II

【题目】 Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, ...

2014-01-28 22:31:51

阅读数:1743

评论数:0

LeetCode之Remove Duplicates from Sorted List II

【题目】 Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list. For exampl...

2014-01-28 22:31:00

阅读数:1

评论数:0

提示
确定要删除当前文章?
取消 删除