
LeetCode OJ Problem - 1
Difficulty: Easy
Problem
Solution
Directly loop across the array(vector)
AC Code
Language: C++
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> ans;
for(int i=0;i<nums.size();++i){
for(int j=i+1;j<nums.size();++j){
if(nums[i] + nums[j] == target){
ans.push_back(i);
ans.push_back(j);
return ans;
}
}
}
return ans;
}
};
Language: Java
public class Solution {
public int[] twoSum(int[] nums, int target) {
int[] ans = new int[2];
for(int i=0;i<nums.length;++i){
for(int j=i+1;j<nums.length;++j){
if(nums[i] + nums[j] == target){
ans[0] = i;
ans[1] = j;
return ans;
}
}
}
return ans;
}
}




近期评论