leetcode

0 class Solution {

1 public:

2 vector<string> getWordsInLongestSubsequence(const int n, const vector<string> &words,

3 const vector<int> &groups) const {

4 vector<string> res;

5 int crnt = groups[0];

6 res.push_back(words[0]);

7 for (int i = 1; i < n; i++)

8 if (groups[i] != crnt) res.push_back(words[i]), crnt = !crnt;

9 return res;

10 }

11 };