-
Notifications
You must be signed in to change notification settings - Fork 0
/
0167-Two-sum-II-input-array-is-sorted.cs
42 lines (36 loc) · 1.22 KB
/
0167-Two-sum-II-input-array-is-sorted.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
using System;
using System.Collections.Generic;
using System.Text;
namespace Solution._0167.Two_sum_II_input_array_is_sorted
{
public class _0167_Two_sum_II_input_array_is_sorted
{
public int[] TwoSum(int[] numbers, int target)
{
int left = 0;
int right = numbers.Length - 1;
while (left < right)
{
if (numbers[left] + numbers[right] == target)
return new int[] { left + 1, right + 1 };
if (numbers[left] + numbers[right] < target)
left++;
else
right--;
}
return new int[] { left + 1, right + 1 };
// Time Limit Exceeded
//// 逐一取得每個元素
//for (int i = 0; i < numbers.Length; i++)
//{
// // 依照取得元素的索引,與索引後的陣列
// for (int j = i + 1; j < numbers.Length; j++)
// {
// if (numbers[i] + numbers[j] == target)
// return new int[] { i + 1, j + 1 };
// }
//}
//throw new Exception("No two sum solution.");
}
}
}