diff --git a/HuangJunLong/leetcode/1.TwoSum.md b/HuangJunLong/leetcode/1.TwoSum.md new file mode 100644 index 0000000..f3bd50c --- /dev/null +++ b/HuangJunLong/leetcode/1.TwoSum.md @@ -0,0 +1,31 @@ +Given an array of integers, return **indices** of the two numbers such that they add up to a specific target. + +You may assume that each input would have ***exactly\*** one solution, and you may not use the *same* element twice. + +**Example:** + +``` +Given nums = [2, 7, 11, 15], target = 9, + +Because nums[0] + nums[1] = 2 + 7 = 9, +return [0, 1]. +``` + +```java +/** +*暴力解法 +*/ +class Solution { + public int[] twoSum(int[] nums, int target) { + for(int i= 0;i < nums.length;i++){ + for(int j=i+1;j