兩個string 都有字母和backspace飒房,然后看最后是不是一樣的結(jié)果 從后往前traverse O(N) + O(1)
![240](https://cdn2.jianshu.io/assets/default_avatar/7-0993d41a595d6ab6ef17b19496eb2f21.jpg?imageMogr2/auto-orient/strip|imageView2/1/w/240/h/240)
DZone ArrayList vs. LinkedList vs. Vector From the hierarchy diagram, they all implemen...
給兩個string,比如 lee和eel, 找到一個最短的string, 它的substring包含這兩個stirng, 比如 leel. 找A與B的交集 Follow-up...
給一個pattern, check true or false萌朱, 比如abbba->cdddc就是true sol: 每個字母一種映射(hashmap) follow up:...
給一個數(shù)組,要求你盡可能多的切割這個數(shù)組做入,使得每一個小段分別sort之后冒晰,整個數(shù)組就sort了 if minValue of Latter chunk is larger t...
Given a grid[][], one can only move either right, right up or right down at any point i...
LC 727 Description Given strings S and T, find the minimum (contiguous) substring W of ...