1 class Solution {
 2 public:
 3     vector<int> FindNumbersWithSum(vector<int> array, int sum)
 4     {
 5         vector<int> re;
 6         if (array.empty() || sum == 0)
 7             return re;
 8         for (auto b = array.begin(), e = array.end() - 1; b< e;)
 9         {
10             if (*b + *e == sum)
11             {
12                 re.push_back(*b);
13                 re.push_back(*e);
14                 break;
15             }
16             else {
17                 if (*b + *e < sum)
18                     ++b;
19                 else
20                     --e;
21             }
22         }
23         return re;
24     }
25 };

 1 class Solution
 2 {
 3 public:
 4     vector<vector<int> > FindContinuousSequence(int sum)
 5     {
 6         vector<vector<int> > re;
 7         if (sum <= 0)
 8             return re;
 9
10         for (int i = 1, j = 2; j <= sum / 2 + 1;)
11         {
12             int s = 0;
13             for (int k = i; k <= j; k++)
14                 s = s + k;
15             if (s == sum)
16             {
17                 vector<int> tem;
18                 for (int k = i; k <= j; k++)
19                     tem.push_back(k);
20                 re.push_back(tem);
21                 j++;//记住在for循环里无论哪一种情况都要对变量更新
22             }
23             else
24             {
25                 if (s < sum)
26                 {
27                     j++;
28                 }
29                 else
30                 {
31                     i++;
32                 }
33             }
34         }
35         return re;
36     }
37 };