C解1.Two Sum——LeetCode刷题

标签：sum   刷题   input   col   ice   etc   targe   inpu   sam   

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].

Code：

 1 int* twoSum(int* nums, int numsSize, int target) {
 2   int* a = (char*)malloc(2 * sizeof(int));
 3   for (a[0] = 0; a[0] < numsSize; ++a[0]) {
 4     for (a[1] = a[0] + 1; a[1] < numsSize; ++a[1]) {
 5       if (nums[a[0]] + nums[a[1]] == target) {
 6         return a;
 7       }
 8     }
 9   }
10   return a;
11 }

C解1.Two Sum——LeetCode刷题

标签：sum   刷题   input   col   ice   etc   targe   inpu   sam   

原文地址：https://www.cnblogs.com/LiXinx/p/10372147.html