争取每天一道LeetCode吧。
题目:Given an array of integers, return indices of the two numbers such that they add up to a specific target.
例子:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
我的答案:
public class Solution { public int[] twoSum(int[] nums, int target) { for(int i = 0;i<nums.length-1;i++){ for(int j = i+1;j<nums.length;j++){ if(nums[i]+nums[j]==target){ return new int[]{i,j}; } } } return null;//应该可以去掉。无所谓啦 } }
第一次写博客,格式什么的都不太会。题目也比较简单,用来当日记吧。