Merge pull request neetcode-gh#79 from helderzack/two_sum_two_solution

Solution of the two sum II problem usign Java.

Author: neetcode-gh

java/167-Two-Sum-II.java

@@ -0,0 +1,24 @@
+class Solution {
+    public int[] twoSum(int[] numbers, int target) {
+        int a_pointer = 0;
+        int b_pointer = numbers.length - 1;
+        int num_a, num_b;
+        
+        while(a_pointer < b_pointer) {
+            num_a = numbers[a_pointer];
+            num_b = numbers[b_pointer];
+            
+            if(num_a + num_b == target) break;
+            
+            if(num_a + num_b < target) {
+                a_pointer++;
+                continue;
+            }
+            
+            b_pointer--;
+            
+        }
+        
+        return new int[]{a_pointer + 1, b_pointer + 1};
+    }
+}