关于两数之和——算法
最新推荐文章于 2024-08-23 11:09:16 发布
public class Solution {public int [] sum(int [] num,int target){for(int i = 0; 我<num.length; i ++){for(int j = 0; j <num.length; j ++){if(num [j] == target - num [i]){return new int [] {i,j}; }
算法解析:两个用于循环查找对应的数,然后,如果语句判断如果(NUM [J] ==目标 - NUM [I])找出符合两数和等于指定数的结论。暴力算法:时间复杂度O(n2)。空间复杂度:O(1)。解法二:“`class Solution {public int [] twoSum(int [] nums,int target {Map