由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
JobHunting版 - SUM3这道题
相关主题
为什么oj.leetcode上面的triangle那道题总是超时请教leetcode上的那道Word Break II,多谢!
leetcode 4sum N^3解法有时Time Limit Exceeded有时又能通过请问大牛们leetcode上的Permutations II
求助:3sum总是运行不过问leetcode上surrounded regions,新的test case出runtime error
3sum on LeetCode OJleetcode 关于Partition List
我这个按层打印的有什么问题Time limit exceeded for Word Ladder(leetcode)
leetcode上zigzag converstion那题怎么才能通过large?大牛看看为撒这个sqrt binary search过不了OJ
[BSSD]回国一趟回来做题很难进入状态了,顺便问下那个Merge k Sorted请教下3sum为撒超时
不明白leetcode OJ wordladder 2 总是 Time Limit Exceeded实现regex(.*+)和wildcard(?*)匹配的题
相关话题的讨论汇总
话题: num话题: tempk话题: tempj话题: len话题: vector
进入JobHunting版参与讨论
1 (共1页)
s*******y
发帖数: 105
1
在leetcode网上看到一种解法,感觉是对的,但是通不过OJ,显示Time Limit
Exceeded, 懂的童鞋给分析下code哪里有问题,3ks~
class Solution {
public:
vector > threeSum(vector &num) {
// Start typing your C/C++ solution below
// Start typing your C/C++ solution below
// DO NOT write int main() function
sort(num.begin(),num.end());
vector > r;
vector a;
int len = num.size();
if( len < 3 || num[0] > 0 || num[len-1] < 0 )
{
return r;
}
int i,j,k,sum,tempj,tempk,prev=num[0]-1;
for( i = 0; i < len-2 && num[i] < 0; ++i )//outer for
{
if( num[i] == prev )
{
continue;
}
prev = num[i];
for( j = i+1; k = len-1; j < k) //inner for
{
sum = num[i] + num[j] + num[k];
if( sum == 0 )
{
a.push_back(num[i]);
a.push_back(num[j]);
a.push_back(num[k]);
r.push_back(a);
a.clear();
tempj = num[j];
tempk = num[k];
while( j < k && num[j] == tempj )
++j;
while( k > j && num[k] == tempk )
--k;
}
else if( sum < 0 )
{
tempj = num[j];
while( j < k && num[j] == tempj )
++j;
}
else
{
tempk = num[k];
while( k > j && num[k] == tempk )
--k;
}
}//end inner for
}//end outer for
if( i < len-2 && num[i] == 0 && num[i+1] == 0 && num[i+2] == 0 )
{
a.assign(3,0);
r.push_back(a);
}
return r;
}
};
g****y
发帖数: 240
2
for( j = i+1; k = len-1; j < k) //inner for
这个。。。。不对吧。
1 (共1页)
进入JobHunting版参与讨论
相关主题
实现regex(.*+)和wildcard(?*)匹配的题我这个按层打印的有什么问题
leecode上的divide two integers问题leetcode上zigzag converstion那题怎么才能通过large?
求DEBUG Substring with Concatenation of All Words[BSSD]回国一趟回来做题很难进入状态了,顺便问下那个Merge k Sorted
LeetCode 的java large case为什么有时候过,有时候time exceed呢?不明白leetcode OJ wordladder 2 总是 Time Limit Exceeded
为什么oj.leetcode上面的triangle那道题总是超时请教leetcode上的那道Word Break II,多谢!
leetcode 4sum N^3解法有时Time Limit Exceeded有时又能通过请问大牛们leetcode上的Permutations II
求助:3sum总是运行不过问leetcode上surrounded regions,新的test case出runtime error
3sum on LeetCode OJleetcode 关于Partition List
相关话题的讨论汇总
话题: num话题: tempk话题: tempj话题: len话题: vector