TwoSum IN LeetCode

quetion 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]. Solution C int* twoSum(int* nums, int numsSize, int target, int* returnSize){ int x,y,m,n; int* array = (int*)malloc(2 * sizeof(int)); while(x <= (numsSize - 2)){ y = x + 1; while(y <= (numsSize - 1)){ if((*(nums + x) + *(nums + y) ) == target ){ m = x; n = y; break; } ......

April 2020
M T W T F S S
 12345
6789101112
13141516171819
20212223242526
27282930