LeetCode Path 3Sum

 1 class Solution {
 2 public:
 3     int threeSumClosest(vector<int> &num, int target) {
 4         // Start typing your C/C++ solution below
 5         // DO NOT write int main() function
 6         int i,j,k;
 7         int r;
 8         int len=num.size();
 9         r=INT_MAX/10;
10         for(i=0;i<len;i++)
11         {
12             for(j=0;j<len;j++)
13             {
14                 if(j==i)
15                     continue;
16                 for(k=0;k<len;k++)
17                 {
18                     if(k==i||k==j)
19                         continue;
20                     int t=num[i]+num[j]+num[k];
21                     if(abs(t-target)<abs(r-target))
22                           r=t;
23                     if(r==target)
24                         return r;
25                 }
26             }
27         }
28         return r;
29     }
30 };
加入第23行就不超时了