Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
CheckPoint: if (numbers != null && numbers.length > 1) {throw new IllegalArgumentException(“No solution!”);}
1st:
2nd:
