LeetCode解题思路之Two Sum

##问题描述 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].

数组中找到相加结果为指定值的元素位置

##解题思路 直接暴力计算，没什么好说的

##代码

/**   
 * Note: The returned array must be malloced, assume caller calls free().   
 */
int* twoSum(int* nums, int numsSize, int target) 
{
	int rowValue = 0;
	int colValue = 0;
    for (int row = 0; row < numsSize - 1; row++)
    {
    	bool find = false;
    	int firstValue = nums[row];
    	for (int col = row + 1; col < numsSize; col++)
    	{
    		int secondValue = nums[col];
    		if ((firstValue + secondValue) == target)
    		{
    			rowValue = row;
    			colValue = col;
    			find = true;
    			break;
    		}
    	}
    	if (find)
    	{
    		break;
    	}
    }

    int* arr = (int*)malloc(2*sizeof(int));
    arr[0] = rowValue;
    arr[1] = colValue;
    return arr;
}

转载于:https://my.oschina.net/applepeel/blog/994743