算法

crossoverJie · crossoverJie · commit 6abc9f202137 · 2018-01-04T10:10:27.000+08:00
diff --git a/src/main/java/com/crossoverjie/algorithm/TwoSum.java b/src/main/java/com/crossoverjie/algorithm/TwoSum.java
@@ -0,0 +1,27 @@
+package com.crossoverjie.algorithm;
+
+/**
+ * Function:
+ *
+ * @author crossoverJie
+ *         Date: 04/01/2018 09:53
+ * @since JDK 1.8
+ */
+public class TwoSum {
+
+    public int[] getTwo1(int[] nums,int target){
+        int[] result = new int[2] ;
+
+        for (int i= 0 ;i<nums.length ;i++){
+            int a = nums[i] ;
+            for (int j = nums.length -1 ;j >=0 ;j--){
+                int b = nums[j] ;
+
+                if ((a+b) == target){
+                    result = new int[]{i,j} ;
+                }
+            }
+        }
+        return result ;
+    }
+}
diff --git a/src/test/java/com/crossoverjie/algorithm/TwoSumTest.java b/src/test/java/com/crossoverjie/algorithm/TwoSumTest.java
@@ -0,0 +1,16 @@
+package com.crossoverjie.algorithm;
+
+import com.alibaba.fastjson.JSON;
+import org.junit.Test;
+
+public class TwoSumTest {
+    @Test
+    public void getTwo1() throws Exception {
+        TwoSum twoSum = new TwoSum() ;
+        int[] nums ={1,3,5,7};
+        int[] two1 = twoSum.getTwo1(nums, 12);
+        System.out.println(JSON.toJSONString(two1));
+
+    }
+
+}
