[LeetCode]Two Sum

题目：点击打开链接

public class Solution {    public int[] twoSum(int[] nums, int target) {        if (null == nums) {            return null;        }        int length = nums.length;        if (0 == length) {            return null;        }        int[] result = new int[2];        for (int i = 0; i < length; i++) {            for (int j = i + 1; j < length; j++) {                if (target == nums[i] + nums[j]) {                    result[0] = i + 1;                    result[1] = j + 1;                    return result;                }            }        }        return null;    }}