leetcode

Leetcode submissions
git clone git://git.laack.co/leetcode.git
Log | Files | Refs | README

non-overlapping-v2.cpp (618B)

      1 class Solution {
      2 public:
      3     int maxTwoEvents(vector<vector<int>>& events) {
      4         int best = 0;
      5         for(int i = 0; i < events.size(); ++i){
      6             vector<int> first = events[i];
      7             if(first[2] > best){
      8                 best = first[2];
      9             }
     10 
     11             for(int x = 0; x < events.size() ; ++x){
     12                 vector<int> second = events[x];
     13                 if(second[0] > first[1]){
     14                     if(second[2] + first[2] > best){
     15                         best = second[2] + first[2];
     16                     }
     17                 }    
     18             }
     19         }
     20         return best;
     21     }
     22 };