Given an array of integers that is already sorted in ascending order, find two numbers such that the

這道題本身思路也對了，就是數組使用出了點問題，而後就是看了別人的代碼才改過來，用到匿名數組。數組 很少說，看代碼，get   class Solution {     public int[] twoSum(int[] numbers, int target) {     if(numbers==null || numbers.length < 1) return null;         in

>>阅读原文<<