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

Appearance settings

Latest commit

 

History

History
History
25 lines (20 loc) · 627 Bytes

File metadata and controls

25 lines (20 loc) · 627 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
package leetcode._92_;
import leetcode.common.ListNode;
/**
* Created by zhangbo54 on 2019-03-04.
*/
public class Main {
public static void main(String[] args) {
Solution solution = new Solution();
ListNode node1 = new ListNode(1);
ListNode node2 = new ListNode(2);
ListNode node32 = new ListNode(3);
ListNode node41 = new ListNode(4);
ListNode node5 = new ListNode(5);
node1.next = node2;
node2.next = node32;
node32.next = node41;
node41.next = node5;
System.out.println(solution.reverseBetween(node1, 2, 4));
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.