problem
392. Is Subsequence
solution#1: two pointers,快慢指針;
code
solution#2:
Follow Up中描述有很長的字元串,如何優化;
使用 uppper_bound() 來二分查找第一個大于 pre 的位置;
code
參考
1. leetcode_easy_BS_392. Is Subsequence;
problem
392. Is Subsequence
solution#1: two pointers,快慢指針;
code
solution#2:
Follow Up中描述有很長的字元串,如何優化;
使用 uppper_bound() 來二分查找第一個大于 pre 的位置;
code
參考
1. leetcode_easy_BS_392. Is Subsequence;