Block me too much time, it is use two pointer to do. First is fix one numbers, then use two pointer to scan the remain sorted list and get the result. The time complexity is O(n^2). Just remember to deal with duplicate number
Update: remember, do not optimize the left and right if target != nums[left] + nums[right]
