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) |
Modifier and Type | Method and Description |
---|---|
void |
Solution.deleteNode(ListNode node) |
void |
Solution.deleteNode(ListNode node) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.oddEvenList(ListNode head) |
ListNode |
Solution.oddEvenList(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.oddEvenList(ListNode head) |
ListNode |
Solution.oddEvenList(ListNode head) |
Constructor and Description |
---|
Solution(ListNode head) |
Solution(ListNode head) |
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.splitListToParts(ListNode head,
int k) |
ListNode[] |
Solution.splitListToParts(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
ListNode[] |
Solution.splitListToParts(ListNode head,
int k) |
ListNode[] |
Solution.splitListToParts(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.numComponents(ListNode head,
int[] nums) |
int |
Solution.numComponents(ListNode head,
int[] nums) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.middleNode(ListNode head) |
ListNode |
Solution.middleNode(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.middleNode(ListNode head) |
ListNode |
Solution.middleNode(ListNode head) |
Modifier and Type | Method and Description |
---|---|
int[] |
Solution.nextLargerNodes(ListNode head) |
int[] |
Solution.nextLargerNodes(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.removeZeroSumSublists(ListNode head) |
ListNode |
Solution.removeZeroSumSublists(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.removeZeroSumSublists(ListNode head) |
ListNode |
Solution.removeZeroSumSublists(ListNode head) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.getDecimalValue(ListNode head) |
int |
Solution.getDecimalValue(ListNode head) |
Modifier and Type | Method and Description |
---|---|
boolean |
Solution.isSubPath(ListNode head,
TreeNode root) |
boolean |
Solution.isSubPath(ListNode head,
TreeNode root) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeInBetween(ListNode list1,
int a,
int b,
ListNode list2) |
ListNode |
Solution.mergeInBetween(ListNode list1,
int a,
int b,
ListNode list2) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeInBetween(ListNode list1,
int a,
int b,
ListNode list2) |
ListNode |
Solution.mergeInBetween(ListNode list1,
int a,
int b,
ListNode list2) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.swapNodes(ListNode head,
int k) |
ListNode |
Solution.swapNodes(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.swapNodes(ListNode head,
int k) |
ListNode |
Solution.swapNodes(ListNode head,
int k) |
Modifier and Type | Method and Description |
---|---|
int[] |
Solution.nodesBetweenCriticalPoints(ListNode head) |
int[] |
Solution.nodesBetweenCriticalPoints(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverseEvenLengthGroups(ListNode head) |
ListNode |
Solution.reverseEvenLengthGroups(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.reverseEvenLengthGroups(ListNode head) |
ListNode |
Solution.reverseEvenLengthGroups(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.deleteMiddle(ListNode head) |
ListNode |
Solution.deleteMiddle(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.deleteMiddle(ListNode head) |
ListNode |
Solution.deleteMiddle(ListNode head) |
Modifier and Type | Method and Description |
---|---|
int |
Solution.pairSum(ListNode head) |
int |
Solution.pairSum(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeNodes(ListNode head) |
ListNode |
Solution.mergeNodes(ListNode head) |
Modifier and Type | Method and Description |
---|---|
ListNode |
Solution.mergeNodes(ListNode head) |
ListNode |
Solution.mergeNodes(ListNode head) |
Modifier and Type | Method and Description |
---|---|
int[][] |
Solution.spiralMatrix(int m,
int n,
ListNode head) |
int[][] |
Solution.spiralMatrix(int m,
int n,
ListNode head) |
Copyright © 2022. All rights reserved.