Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 3bef48c

Browse files
committed
feat: add leetcode question #92
1 parent 7823685 commit 3bef48c

File tree

3 files changed

+63
-1
lines changed

3 files changed

+63
-1
lines changed

‎00-code(源代码)/src/com/hi/dhl/algorithms/leetcode/_025/kotlin/Solution.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -48,4 +48,4 @@ class Solution {
4848
}
4949
return len
5050
}
51-
}
51+
}
Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
package com.hi.dhl.algorithms.leetcode._92.java;
2+
3+
import com.hi.dhl.algorithms.model.ListNode;
4+
5+
/**
6+
* <pre>
7+
* author: dhl
8+
* date : 2022年6月30日
9+
* desc :
10+
* </pre>
11+
*/
12+
class Solution {
13+
public ListNode reverseBetween(ListNode head, int left, int right) {
14+
ListNode dummyNode = new ListNode(0);
15+
dummyNode.next = head;
16+
ListNode p = dummyNode;
17+
int m = left;
18+
while (--m != 0) {
19+
p = p.next;
20+
}
21+
ListNode q = p.next;
22+
int k = right - left;
23+
while (k-- != 0) {
24+
ListNode node = q.next;
25+
q.next = q.next.next;
26+
node.next = p.next;
27+
p.next = node;
28+
}
29+
return dummyNode.next;
30+
}
31+
}
Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
package com.hi.dhl.algorithms.leetcode._92.kotlin
2+
3+
import com.hi.dhl.algorithms.model.ListNode
4+
5+
/**
6+
* <pre>
7+
* author: dhl
8+
* date : 2022年6月30日
9+
* desc :
10+
* </pre>
11+
*/
12+
class Solution {
13+
fun reverseBetween(head: ListNode?, left: Int, right: Int): ListNode? {
14+
val dummyNode = ListNode(0)
15+
dummyNode.next = head
16+
var p = dummyNode
17+
var m = left
18+
while (--m != 0) {
19+
p = p.next
20+
}
21+
var q = p.next
22+
var k = right - left
23+
while (k-- != 0) {
24+
val node = q.next
25+
q.next = q.next.next
26+
node.next = p.next
27+
p.next = node
28+
}
29+
return dummyNode.next
30+
}
31+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /