16 lines
454 B
Python
16 lines
454 B
Python
# https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i
|
|
|
|
from typing import List
|
|
|
|
class Solution:
|
|
def getLongestSubsequence(self, words: List[str], groups: List[int]) -> List[str]:
|
|
result = []
|
|
last = -1
|
|
for i in range(len(words)):
|
|
if last == groups[i]:
|
|
continue
|
|
else:
|
|
result.append(words[i])
|
|
last = groups[i]
|
|
return result
|
|
|