001Two Sum (C)
2016-01-03 21:29
169 查看
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
/** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* nums, int numsSize, int target) { int i,j; int *a=(int*)malloc(sizeof(int)*2); for(i=0;i<numsSize;i++){ for(j=i+1;j<numsSize;j++){ if(nums[i]+nums[j]==target){ a[0]=i+1; a[1]=j+1; return a; } } } }
相关文章推荐
- <Java>函数的参数是数组
- 2015年终总结
- 深入了解View的绘制流程
- 遗传算法解决旅行商问题(TSP)
- js'中的apply和call和bind的用法
- KVC和KVO
- 详解CSS float属性
- 反序输出正整数和求数组交集的问题
- Introduction to the SQL Server Analysis Services Logistic Regression Data Mining Algorithm
- Python 递归 list不正确
- jdk的 安装
- storm-kafka的使用
- redis单机多实例使用
- Bitmap.Config RGB
- *LeetCode 29. Divide Two Integers
- Android开发,在Activity中切换不同的Fragment
- 工作要求
- http-http协议
- Kafka设计
- MHA配置参数详解