[LeetCode] Insert Interval 插入区间

1. #include
   #include
   using namespace std;
   vector<vector> InsertInterval(vector<vector> &veclist, vector &vecInsert)
   {
   vector<vector> res;
   int start = vecInsert[0];
   int end = vecInsert[1];
   bool flag = false;
   for (int i = 0; i < veclist.size(); i++)
   {
   int start1 = veclist[i][0];
   int end1 = veclist[i][1];
   if(!flag)
   {
   if (end < start1)
   {
   flag = true;
   vector vectemp{ start,end };
   res.push_back(vectemp);
   res.push_back(veclist[i]);
   }
   else if (end == start1)
   {
   flag = true;
   vector vectemp{ start,end1 };
   res.push_back(vectemp);
   }
   else if (start <= start1 && end > start1 && end <= end1)
   {
   flag = true;
   vector vectemp{ start,end1 };
   res.push_back(vectemp);
   }
   else if (start > start1 && end <= end1)
   {
   flag = true;
   vector vectemp{ start1,end1 };
   res.push_back(vectemp);
   }
   else if (start <= start1 && end > end1)
   {
   continue;
   }
   else if (start > start1 && start<=end1 && end > end1)
   {
   start = start1;
   continue;
   }
   else if (start > end1)
   {
   res.push_back(veclist[i]);
   continue;
   }
   }
   else
   {
   res.push_back(veclist[i]);
   }
   }
   return res;
   }
   int main()
   {
   //[[1,2],[3,5],[6,7],[8,10],[12,16]]
   vector vec{ 1,2 };
   vector vec1{ 3,5 };
   vector vec2{ 6,7 };
   vector vec3{ 8,10 };
   vector vec4{ 12,16 };
   vector<vector> vecList{ vec,vec1,vec2,vec3,vec4 };
   vector vec5{ 4,8 };
   vector<vector> res = InsertInterval(vecList, vec5);
   system(“pause”);
   return 0;
   }
   许多比较结果都可以合并感觉。