[LeetCode] Two Sum

一刷：

import java.util.Arrays;public class Solution1 {
public int[] twoSum(int[] nums, int target) {int[] index=new int[2];int sum=0;for (int i = 0; i < nums.length; i++) {for (int j = i+1; j < nums.length; j++) {sum=nums[i]+nums[j];index[0]= i;index[1]=j;if (sum==target) {return index;}}}return index;}
public static void main(String[] args) {Solution1 s=new Solution1();int[] nums={3,2,4};int target=6;System.out.println(Arrays.toString(s.twoSum(nums, target)));}
}

import java.util.Arrays;public class Solution {
public int[] twoSum(int[] nums, int target) {int[] index=new int[2];int a;for (int i = 0; i < nums.length; i++) {a=target;a-=nums[i];for (int j = i+1; j < nums.length; j++) {if (a==nums[j]) {index[0]= i;index[1]=j;return index;}}}return index;}
public static void main(String[] args) {Solution s=new Solution();int[] nums={2,7,11,15};int target=9;System.out.println(Arrays.toString(s.twoSum(nums, target)));}
}

这有点惨呐=.=!

2019-05-17 03:54:26

转载于:https://www.cnblogs.com/xybz/p/10879215.html

[LeetCode] Two Sum相关推荐

【同113】LeetCode 129. Sum Root to Leaf Numbers
LeetCode 129. Sum Root to Leaf Numbers Solution1:我的答案二叉树路径和问题,类似113 /*** Definition for a binary tr ...
LeetCode Path Sum III(前缀和)
问题: 给定一个二叉树,它的每个结点都存放着一个整数值. 找出路径和等于给定数值的路径总数. 路径不需要从根节点开始,也不需要在叶子节点结束,但是路径方向必须是向下的(只能从父节点到子节点). 二叉树 ...
LeetCode Combination Sum IV(动态规划)
问题:给出一个数组nums和目标数target,问有多少组合形式思路:用dp(i)表示目标数target的组合数.则有状态转移关系为dp(i)=sum(dp(i-nums[j])),其中i>= ...
LeetCode Range Sum Query - Mutable(树状数组、线段树)
问题:给出一个整数数组,求出数组从索引i到j范围内元素的总和.update(i,val)将下标i的数值更新为val 思路:第一种方式是直接根据定义,计算总和时直接计算从i到j的和第二种方式是使用树状 ...
LeetCode Two Sum III - Data structure design
原题链接在这里:https://leetcode.com/problems/two-sum-iii-data-structure-design/ 题目: Design and implement a ...
LeetCode Subarray Sum Equals K
原题链接在这里:https://leetcode.com/problems/subarray-sum-equals-k/description/ 题目: Given an array of integ ...
leetcode 907. Sum of Subarray Minimums | 907. 子数组的最小值之和（单调栈）
题目 https://leetcode.com/problems/sum-of-subarray-minimums/ 题解单调栈问题.参考左神算法课:https://ke.qq.com/webcou ...
leetcode 371. Sum of Two Integers | 371. 两整数之和（补码运算）
题目 https://leetcode.com/problems/sum-of-two-integers/ 题解根据 related topics 可知,本题考察二进制运算. 第一次提交的时候,没想 ...
[Leetcode]Two sum(两数之和)系列总结
Two sum 题目 Given an array of integers, return indices of the two numbers such that they add up to a ...
leetcode -- 3 sum
3-sum 题目描写叙述: Given an array S of n integers, are there elements a, b, c in S such that a + b + c = ...

[LeetCode] Two Sum

[LeetCode] Two Sum相关推荐

最新文章

热门文章