We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
原题链接:https://leetcode-cn.com/problems/two-sum/
解题思路:
/** * @param {number[]} nums * @param {number} target * @return {number[]} */ var twoSum = function(nums, target) { for (let i = 0; i < nums.length - 1; i++) { // 遍历i之后的元素 for (let j = i + 1; j < nums.length; j++) { // 如果两个元素之和为target,则返回结果 if (nums[i] + nums[j] === target) { return [i, j]; } } } };
The text was updated successfully, but these errors were encountered:
No branches or pull requests
原题链接:https://leetcode-cn.com/problems/two-sum/
解题思路:
The text was updated successfully, but these errors were encountered: