opt: opt 001

Author: Blankj

note/001/README.md

@@ -25,9 +25,8 @@ return [0, 1].
 ```java
 class Solution {
     public int[] twoSum(int[] nums, int target) {
-        int st = 0, end = nums.length;
-        for (int i = 0; i < end; ++i) {
-            for (int j = i + 1; j < end; ++j) {
+        for (int i = 0; i < nums.length; ++i) {
+            for (int j = i + 1; j < nums.length; ++j) {
                 if (nums[i] + nums[j] == target) {
                     return new int[]{i, j};
                 }

src/com/blankj/easy/_001/Solution.java

@@ -13,9 +13,8 @@
  */
 public class Solution {
 //    public int[] twoSum(int[] nums, int target) {
-//        int st = 0, end = nums.length;
-//        for (int i = 0; i < end; ++i) {
-//            for (int j = i + 1; j < end; ++j) {
+//        for (int i = 0; i < nums.length; ++i) {
+//            for (int j = i + 1; j < nums.length; ++j) {
 //                if (nums[i] + nums[j] == target) {
 //                    return new int[]{i, j};
 //                }