167.Two Sum II_Input array is sorted
来源:互联网 发布:linux sleep 单位 编辑:程序博客网 时间:2024/05/21 11:24
/*
DescriptionHintsSubmissionsSolutions
Given an array of integers that is already sorted in ascending order, 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 and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
*/
/**
* Return an array of size *returnSize.
* Note: The returned array must be malloced, assume caller calls free().
*/
//解法一 13% 406ms
int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) {
int* num,i,j;
*returnSize = 2;
num = (int*)malloc(2*sizeof(int*));
for(i=0;i<numbersSize-1;i++)
for(j=i+1;j<numbersSize;j++)
if( ( (numbers[i] + numbers[j]) == target) && ( i != j ) )
{
num[0] = i+1;
num[1] = j+1;
return num;
}
return;
}
DescriptionHintsSubmissionsSolutions
Given an array of integers that is already sorted in ascending order, 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 and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
*/
/**
* Return an array of size *returnSize.
* Note: The returned array must be malloced, assume caller calls free().
*/
//解法一 13% 406ms
int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) {
int* num,i,j;
*returnSize = 2;
num = (int*)malloc(2*sizeof(int*));
for(i=0;i<numbersSize-1;i++)
for(j=i+1;j<numbersSize;j++)
if( ( (numbers[i] + numbers[j]) == target) && ( i != j ) )
{
num[0] = i+1;
num[1] = j+1;
return num;
}
return;
}
阅读全文
0 0
- 167.Two Sum II_Input array is sorted
- Leetcode-167.Two Sum II - Input array is sorted
- [leetcode] 167. Two Sum II - Input array is sorted
- 【leetcode】167. Two Sum II - Input array is sorted
- 【LeetCode】167. Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted
- [LeetCode OJ]167. Two Sum II - Input array is sorted
- [leetcode]167. Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted
- leecode 167. Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted**
- 167. Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted [medium] (Python)
- 167. Two Sum II - Input array is sorted
- leetcode-java-167. Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted
- gulp-connect-php 配置
- GET方式请求表单的action属性后不能带参数
- 关于MySQL AUDIT(审计)那点事
- 基于Spring Boot和Spring Cloud实现微服务架构学习(六)-Docker应用
- Bootstrap3 datetimepicker控件使用实例详解
- 167.Two Sum II_Input array is sorted
- IRQL
- linux下给内核打补丁
- git删除文件遇到的问题
- NYOj-部分和问题-深度优先搜索
- System group container for systemgroup.com.apple.configurationprofiles path is
- UVA
- 面试易错题整理(一)
- MD5工具类封装