(self, l1, l2)
| 87 | # get_value = self.getRest() |
| 88 | |
| 89 | def getEqualNodes(self, l1, l2): |
| 90 | # Get equal length. |
| 91 | b_l1 = l1 |
| 92 | b_l2 = l2 |
| 93 | |
| 94 | while b_l1 is not None and b_l2 is not None: |
| 95 | b_l1 = b_l1.next |
| 96 | b_l2 = b_l2.next |
| 97 | |
| 98 | if b_l1: |
| 99 | # l1 is longer than l2 |
| 100 | t_lx = b_l1 |
| 101 | fix_lx = l2 |
| 102 | raw_lx = l1 |
| 103 | else: |
| 104 | t_lx = b_l2 |
| 105 | fix_lx = l1 |
| 106 | raw_lx = l2 |
| 107 | |
| 108 | if t_lx: |
| 109 | root = ListNode(0) |
| 110 | b_root = root |
| 111 | t_lx = t_lx.next |
| 112 | while t_lx: |
| 113 | node = ListNode(0) |
| 114 | root.next = node |
| 115 | root = node |
| 116 | t_lx = t_lx.next |
| 117 | root.next = fix_lx |
| 118 | |
| 119 | return (raw_lx, b_root) |
| 120 | return (l1, l2) |
| 121 | |
| 122 | def getRest(self, l1, l2, rest=0): |
| 123 | # return (val, rest) |