* public init(_ val: Int) { self.val = val; self.next = nil; } * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; } ...
Given a 1-indexed sorted int array & target: Return indices (added by 1) of 2 nums that add to target 2 pointers, outside in, iterate i/j if sum is too low/high ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results