資訊專欄INFORMATION COLUMN
摘要：注意這里，只要走到第位
Swap Nodes in Pairs
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
public class Solution {
public ListNode swapPairs(ListNode head) {
if (head == null || head.next == null) return head;
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode cur = dummy;
while (cur.next != null && cur.next.next != null) {
ListNode n1 = cur.next;
ListNode n2 = cur.next.next;
cur.next = n2;
n1.next = n2.next;
n2.next = n1;
cur = n1;
}
return dummy.next;
}
}
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 k then left-out nodes in the end should remain as it is.
You may not alter the values in the nodes, only nodes itself may be changed.
Only constant memory is allowed.
For example,
Given this linked list: 1->2->3->4->5
For k = 2, you should return: 2->1->4->3->5
For k = 3, you should return: 3->2->1->4->5
Solutionpublic class Solution {
public ListNode reverseKGroup(ListNode head, int k) {
if (head == null || head.next == null || k == 0) return head;
ListNode start = head, end = head;
int count = k-1;
while (count != 0 && end.next != null) {
end = end.next;
count--;
}
if (count == 0) {
ListNode next = end.next;
reverse(start, end);
start.next = reverseKGroup(next, k);
return end;
}
else return start;
}
public void reverse(ListNode start, ListNode end) {
ListNode pre = null;
while (start != end) {
ListNode next = start.next;
start.next = pre;
pre = start;
start = next;
}
start.next = pre;
}
}
Reverse Linked List
Reverse a singly linked list.
NoteCreate tail = null;
Head loop through the list: Store head.next, head points to tail, tail becomes head, head goes to stored head.next;
Return tail.
public class Solution {
public ListNode reverseList(ListNode head) {
ListNode tail = null;
while (head != null) {
ListNode temp = head.next;
head.next = tail;
tail = head;
head = temp;
}
return tail;
}
}
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->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note:Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
public class Solution {
public ListNode reverseBetween(ListNode head, int m, int n) {
if (head == null) return null;
ListNode dummy = new ListNode(0);
dummy.next = head;
ListNode pre = dummy;
int i = 0;
while (i++ < m-1) {//注意這里，pre只要走到第m-1位
pre = pre.next;
}
ListNode cur = pre.next;
ListNode next = pre.next.next;
for (i = 0; i < n-m; i++) {
cur.next = next.next;
next.next = pre.next;
pre.next = next;
next = cur.next;
}
return dummy.next;
}
}
文章版權(quán)歸作者所有，未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請注明本文地址：http://m.hztianpu.com/yun/65185.html
摘要：三指針法復(fù)雜度時間空間思路基本的操作鏈表，見注釋。注意使用頭節(jié)點(diǎn)方便操作頭節(jié)點(diǎn)。翻轉(zhuǎn)后，開頭節(jié)點(diǎn)就成了最后一個節(jié)點(diǎn)。 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 ...
摘要：最后返回頭節(jié)點(diǎn)。同時題目要求只能占用常數(shù)空間，并且不能改變節(jié)點(diǎn)的值，改變的是節(jié)點(diǎn)本身的位置。翻轉(zhuǎn)是以兩個節(jié)點(diǎn)為單位的，我們新聲明一個節(jié)點(diǎn)表示當(dāng)前操作到的位置。每次操作結(jié)束，將指針后移兩個節(jié)點(diǎn)即可。執(zhí)行操作前要確定操作的兩個節(jié)點(diǎn)不為空。 題目詳情 Given a linked list, swap every two adjacent nodes and return its head....
摘要：題目要求翻譯過來就是將鏈表中相鄰兩個節(jié)點(diǎn)交換順序，并返回最終的頭節(jié)點(diǎn)。思路這題的核心解題思路在于如何不占用額外的存儲空間，就改變節(jié)點(diǎn)之間的關(guān)系。 題目要求 Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should r...
閱讀 1144·2021-11-12 10:34
閱讀 1060·2021-09-30 09:56
閱讀 732·2019-08-30 15:54
閱讀 2683·2019-08-30 11:14
閱讀 1566·2019-08-29 16:44
閱讀 3274·2019-08-29 16:35
閱讀 2554·2019-08-29 16:22
閱讀 2515·2019-08-29 15:39
