我的第一题
time limit exceeded
O(N*M)
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21 |
class
Solution {public: vector<int> twoSum(vector<int> &numbers, int
target) { vector<int> ret(2, 0); int
len = numbers.size(); for(int
i=0; i<len; i++) { for(int
j=i+1; j<len; j++) { if(numbers[i] + numbers[j] == target) { ret[0] = i+1; ret[1] = j+1; return
ret; } } } return
ret; }}; |
[LeetCode] Two sum,布布扣,bubuko.com
原文：http://www.cnblogs.com/laon/p/3574449.html