2900. 最长相邻不相等子序列 I

2900. 最长相邻不相等子序列 I

---

题目链接：2900. 最长相邻不相等子序列 I

代码如下：

class Solution {
public:
	vector<string> getLongestSubsequence(vector<string>& words, vector<int>& groups) {
		vector<string> res;
		for (int i = 0;i < groups.size();i++) {
			if (i == groups.size() - 1 || groups[i] != groups[i + 1]) {
				res.push_back(words[i]);
			}
		}
		return res;
	}
};