leetCode 刷题记录-1. Two Sum
2017-03-11 00:00
435 查看
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:
这题是要找出数组中两个数相加的和为target的下标,这道题比较简单但是我也只想到了两重循环来解,复杂度为O(n^2),记录一下防止以后忘记了
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].
这题是要找出数组中两个数相加的和为target的下标,这道题比较简单但是我也只想到了两重循环来解,复杂度为O(n^2),记录一下防止以后忘记了
public class Solution1 { public int[] twoSum(int[] nums, int target) { int[] result = new int[2]; for(int i = 0;i<nums.length-1;i++) { for (int j=i+1;j<nums.length;j++) { if (nums[i] + nums[j] == target) { result[0] = i; result[1] = j; return result; } } } return result; } }
相关文章推荐
- 个人记录-LeetCode 1.Two Sum
- Leetcode习题记录——Two Sum
- 【LeetCode刷题记录】Two Sum
- Python leetcode记录(1) -Two Sum
- leetcode刷题记录--Two Sum
- leetcode刷题记录-Two Sum
- LeetCode_Two Sum
- leetcode -- Two Sum
- LeetCode: Two Sum
- [leetcode刷题系列]Two Sum
- LeetCode刷题笔录 Two Sum
- [LeetCode] Two Sum, Solution
- [leetcode] Two Sum
- leetcode two sum
- [leetcode]Two Sum
- [LeetCode] Two Sum, 3Sum ,3SumCloset , 4Sum
- leetcode 46: Two Sum
- LeetCode 1 - Two Sum
- [Leetcode 13] 1 Two Sum
- [Leetcode] Two Sum