nsum问题是面试中经常会问到的题目,LeetCode上关于nsum的问题有
这里将介绍这四个问题的解答方法,
Two Sum
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].
————————
这道题直接用两个循环暴力解即可,对数组进行遍历查找两个数之和,时间复杂度是O(n^2),在题目允许范围内
class Solution {
public int[] twoSum(int[] nums, int target) {
int tsum[]=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)
{
tsum[0]=i;
tsum[1]=j;
return tsum;
}
}
}
return tsum;
}
}
3Sum
Given an array nums
of n integers, are there elements a, b, c in nums
such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note:
The solution set must no