001Two Sum (C)
来源:互联网 发布:itc智能网络广播系统 编辑:程序博客网 时间:2024/05/29 09:13
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
/** * 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; } } }}
0 0
- 001Two Sum (C)
- Two Sum(C)
- [C++]LeetCode: 14 Two Sum
- Leetcode[1] Two Sum (c++)
- LeetCode::Two Sum C语言
- [c++] LeetCode Two Sum问题
- [1, Medium, C++] Two Sum
- [LeetCode#1][C]Two Sum
- 【LeetCode-1】 Two Sum(C++)
- LeetCode Two Sum(C/JS)
- LeetCode 1. Two Sum (C++)
- LeetCode::Two Sum C语言
- Leetcode c语言-Two Sum
- LeetCode 001 Two Sum
- LeetCode-001 Two Sum
- 【leetcode】001 Two Sum
- 001 Two Sum
- LeetCode 001-Two Sum
- 详解CSS position属性
- 设计模式系列12---遍历统一的迭代模式
- Linux入门教程:CDN加速
- hadoop2.7.0-HA集群部署
- http-http协议
- 001Two Sum (C)
- 工作要求
- Android开发,在Activity中切换不同的Fragment
- 详解CSS float属性
- Python 递归 list不正确
- jdk的 安装
- <Java>函数的参数是数组
- linux中的各种计算方式expr|bc|dc|let
- 2015年终总结