Modifier and Type | Field and Description |
---|---|
ListNode |
ListNode.next |
ListNode |
ListNode.next |
Constructor and Description |
---|
ListNode(int val,
ListNode next) |
ListNode(int val,
ListNode next) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.addTwoNumbers(ListNode l1,
ListNode l2) |
ListNode |
Solution.addTwoNumbers(ListNode l1,
ListNode l2) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.addTwoNumbers(ListNode l1,
ListNode l2) |
ListNode |
Solution.addTwoNumbers(ListNode l1,
ListNode l2) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.removeNthFromEnd(ListNode head,
int n) |
ListNode |
Solution.removeNthFromEnd(ListNode head,
int n) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.removeNthFromEnd(ListNode head,
int n) |
ListNode |
Solution.removeNthFromEnd(ListNode head,
int n) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeTwoLists(ListNode l1,
ListNode l2) |
ListNode |
Solution.mergeTwoLists(ListNode l1,
ListNode l2) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeTwoLists(ListNode l1,
ListNode l2) |
ListNode |
Solution.mergeTwoLists(ListNode l1,
ListNode l2) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeKLists(ListNode[] lists) |
ListNode |
Solution.mergeKLists(ListNode[] lists) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeKLists(ListNode[] lists) |
ListNode |
Solution.mergeKLists(ListNode[] lists) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.swapPairs(ListNode head) |
ListNode |
Solution.swapPairs(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.swapPairs(ListNode head) |
ListNode |
Solution.swapPairs(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverseKGroup(ListNode head,
int k) |
ListNode |
Solution.reverseKGroup(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverseKGroup(ListNode head,
int k) |
ListNode |
Solution.reverseKGroup(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.rotateRight(ListNode head,
int k) |
ListNode |
Solution.rotateRight(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.rotateRight(ListNode head,
int k) |
ListNode |
Solution.rotateRight(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.deleteDuplicates(ListNode head) |
ListNode |
Solution.deleteDuplicates(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.deleteDuplicates(ListNode head) |
ListNode |
Solution.deleteDuplicates(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.deleteDuplicates(ListNode head) |
ListNode |
Solution.deleteDuplicates(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.deleteDuplicates(ListNode head) |
ListNode |
Solution.deleteDuplicates(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.partition(ListNode head,
int x) |
ListNode |
Solution.partition(ListNode head,
int x) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.partition(ListNode head,
int x) |
ListNode |
Solution.partition(ListNode head,
int x) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverse(ListNode head) |
ListNode |
Solution.reverse(ListNode head) |
ListNode |
Solution.reverseBetween(ListNode head,
int left,
int right) |
ListNode |
Solution.reverseBetween(ListNode head,
int left,
int right) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverse(ListNode head) |
ListNode |
Solution.reverse(ListNode head) |
ListNode |
Solution.reverseBetween(ListNode head,
int left,
int right) |
ListNode |
Solution.reverseBetween(ListNode head,
int left,
int right) |
Modifier and Type | Method and Description |
---|---|
TreeNode |
Solution.sortedListToBST(ListNode head) |
TreeNode |
Solution.sortedListToBST(ListNode head) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.hasCycle(ListNode head) |
boolean |
Solution.hasCycle(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.detectCycle(ListNode head) |
ListNode |
Solution.detectCycle(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.detectCycle(ListNode head) |
ListNode |
Solution.detectCycle(ListNode head) |
Modifier and Type | Method and Description |
---|---|
void |
Solution.reorderList(ListNode head) |
void |
Solution.reorderList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.insertionSortList(ListNode head) |
ListNode |
Solution.insertionSortList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.insertionSortList(ListNode head) |
ListNode |
Solution.insertionSortList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.sortList(ListNode head) |
ListNode |
Solution.sortList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.sortList(ListNode head) |
ListNode |
Solution.sortList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.getIntersectionNode(ListNode headA,
ListNode headB) |
ListNode |
Solution.getIntersectionNode(ListNode headA,
ListNode headB) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.getIntersectionNode(ListNode headA,
ListNode headB) |
ListNode |
Solution.getIntersectionNode(ListNode headA,
ListNode headB) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.removeElements(ListNode head,
int val) |
ListNode |
Solution.removeElements(ListNode head,
int val) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.removeElements(ListNode head,
int val) |
ListNode |
Solution.removeElements(ListNode head,
int val) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverseList(ListNode head) |
ListNode |
Solution.reverseList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverseList(ListNode head) |
ListNode |
Solution.reverseList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isPalindrome(ListNode head) |
boolean |
Solution.isPalindrome(ListNode head) |
Copyright © 2021. All rights reserved.