摘要:
一、问题描述 We are given two arrays A and B of words. Each word is a string of lowercase letters. Now, say that word b is a subset of word a if every lette 阅读全文
摘要:
1、目前已经刷了大概200道题目 主要使用的语言是python,刷完之后,发现盲写部分语法依然记不住; 以后刷算法保持一个原则,一定使用不提示代码的工具,纯文本编写,尽量不debug 2、后续尽量使用C++ 3、目前已经写的代码 https://github.com/liqiushui/leetco 阅读全文
摘要:
一、题目描述 You have an array of logs. Each log is a space delimited string of words. For each log, the first word in each log is an alphanumeric identifie 阅读全文