Commit 398bf62

committed

feat: add question #92

1 parent 1d38a9d commit 398bf62Copy full SHA for 398bf62

File tree

+36

-0

lines changed

+36

-0

lines changed

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+//`
	`2`	`+// Created by DHL on 2022年6月30日.`
	`3`	`+//`
	`4`	`+`
	`5`	`+/**`
	`6`	`+ * Definition for singly-linked list.`
	`7`	`+ * struct ListNode {`
	`8`	`+ * int val;`
	`9`	`+ * ListNode *next;`
	`10`	`+ * ListNode() : val(0), next(nullptr) {}`
	`11`	`+ * ListNode(int x) : val(x), next(nullptr) {}`
	`12`	`+ * ListNode(int x, ListNode *next) : val(x), next(next) {}`
	`13`	`+ * };`
	`14`	`+ */`
	`15`	`+class Solution {`
	`16`	`+public:`
	`17`	`+ ListNode reverseBetween(ListNode head, int left, int right) {`
	`18`	`+ ListNode *dummyNode = new ListNode(0);`
	`19`	`+ dummyNode->next = head;`
	`20`	`+ int m = left;`
	`21`	`+ ListNode *p = dummyNode;`
	`22`	`+ while (--m != 0) {`
	`23`	`+ p = p->next;`
	`24`	`+ }`
	`25`	`+`
	`26`	`+ ListNode *q = p->next;`
	`27`	`+ int k = right - left;`
	`28`	`+ while (k-- != 0) {`
	`29`	`+ ListNode *node = q->next;`
	`30`	`+ q->next = q->next->next;`
	`31`	`+ node->next = p->next;`
	`32`	`+ p->next = node;`
	`33`	`+ }`
	`34`	`+ return dummyNode->next;`
	`35`	`+ }`
	`36`	`+};`

Comments

(0)