leetcode 1
作者:互联网
简介
暴力
code
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
for(int i=0; i<nums.size(); i++) {
for(int j=i+1; j<nums.size(); j++) {
if(nums[i] + nums[j] == target) {
return vector<int>{i, j};
}
}
}
return vector<int>();
}
};
class Solution {
public int[] twoSum(int[] nums, int target) {
for(int i=0; i<nums.length; i++) {
for(int j=i+1; j<nums.length; j++){
if(nums[i] + nums[j] == target){
return new int[]{i, j};
}
}
}
return new int[]{};
}
}
标签:nums,int,Solution,public,twoSum,vector,leetcode 来源: https://www.cnblogs.com/eat-too-much/p/14774714.html