大家有没有发现careercup书上的有些题不是最优解法？# JobHunting - 待字闺中
t*s
1 楼
比如
1.1检查一个串有没有重复字符如果charset小的话根据抽屉原理时间是O(1)
4.7检查一个小的二叉树是不是一个大二叉树的子树可以当字符串用KMP
1.1检查一个串有没有重复字符如果charset小的话根据抽屉原理时间是O(1)
4.7检查一个小的二叉树是不是一个大二叉树的子树可以当字符串用KMP
b*n
2 楼
Cool, it's a clever move. It will solve the scenarios where the string
length is larger than 256 (assume the char set is ASCII). You will still
need to do some necessary work for the case of string length less than
256.
That was a solution without using extra memory. KMP is great when you
already have two strings, while in this case, what you've got are two
trees (need extra memory to convert them into strings) and the data might
not be characters.
【在 t*****s 的大作中提到】
: 比如
: 1.1检查一个串有没有重复字符如果charset小的话根据抽屉原理时间是O(1)
: 4.7检查一个小的二叉树是不是一个大二叉树的子树可以当字符串用KMP
相关阅读
Is this one a recruiter?onsite interview transportation两个offer选择 (转载)关于Ｈ１B的ｔｒａｎｓｆｅｒH1B layoff急求建议OPT寄送问题Oracle Webinar hosted by CINAOUG on July 18, 2011 (转载)I765现在为什么下不了问一下Dell的title看到大家offer面试的,我找工作咋就这么难呢?请问如何准备多线程问题第一次电面就约4个小时，做test，正常不？请教: 微软面试和offer (转载)offer letter里面的signoff是什么意思google这题太玩人了吧请教拿到offer后的流程OPT 快三个月还没批问两道数字题写个简单找工作经历攒rp。希望h1b顺利搞定。这是OPT approved 么？