class Solution {
public int[] twoSum(int[] nums, int target) {
int[] result = new int[2];
for(int i = 0;i < nums.length;i++){
for(int j = i+1;j < nums.length;j++){
int sum = nums[i] + nums[j];
if(sum == target){
result[0] = i;
result[1] = j;
return result;
}
}
}
return result;
}
}
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
int i=0,j=0;
int *ans=(int*)malloc(sizeof(int)*2);
for(i=0;i<numsSize-1;i++)
for(j=i+1;j<numsSize;j++)
{
if(nums[i]+nums[j]==target)
{
ans[0]=i;
ans[1]=j;
*returnSize=2;
return ans;
}
}
return 0;
}