5 DERECHA

392. Is Subsequence (Tail recursion / Two-Pointers / 본문

Algorithm

392. Is Subsequence (Tail recursion / Two-Pointers /

kay30 2023. 2. 27. 13:44

중요 표현

cross out = skip

base cases = 0인 경우 예외케이스

 accordingly = 적절하게,i,e) We move the pointers accordingly on the following two cases:

intuition = 직관

comply with = follow