| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/Orio77/LeetCode/master/TwoSumII.java | [Back] [Original] |
class Solution {
public int[] twoSum(int[] numbers, int target) {
int i = 1;
int j = numbers.length -1;
while (i sum)
j--;
if (target < sum)
i++;
}
return new int[0];
}
}
| Web Proxy Viewer | New URL | Original Page |