【leetcode】1. Two Sum

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