LeetCode题解-1-Two Sum
2017-02-17 21:35
357 查看
解题思路
这主要是给第一次接触LeetCode的童鞋准备的。题目说给定一个整型数组和一个数字,希望找到2个位置,这2个位置的和等于给出的数字。解题思路很简单,用一个两层遍历穷举就可以了,如有疑问请参考源码。
参考源码
public class Solution { public int[] twoSum(int[] nums, int target) { int len = nums.length; for (int i = 0; i < len - 1; i++) { for (int j = i + 1; j < len; j++) { if (nums[i] + nums[j] == target) { return new int[]{i, j}; } } } return null; } }
相关文章推荐
- LeetCode题解 —— 1. Two Sum
- leetcode题解-1. Two Sum
- [LeetCode 题解]: Two Sum
- leetcode题解-1.Two Sum
- LeetCode题解系列--1. Two Sum
- LeetCode题解(Golang实现)--Two Sum
- leetcode-Two Sum[题解]
- LeetCode题解--1. Two Sum(和为S的两个数字)
- LeetCode 1 Two Sum 题解
- LeetCode题解 #1 Two Sum
- LeetCode题解——Two Sum
- [LeetCode题解001]Two Sum
- [Leetcode题解]001 Two Sum
- Leetcode:maximum_depth_of_binary_tree题解
- Leetcode题解 - 22. Generate Parentheses
- [leetcode] 1. Two Sum
- LeetCode-1. Two Sum
- leetcode-1. Two Sum
- leetcode 练习1 two sum
- LeetCode题解 #7 Reverse Integer