摘要:
You have k lists of sorted integers. Find the smallest range that includes at least one number from each of the k lists. For example, List 1: [4, 10, 阅读全文
摘要:
1. the most difficult bug u fixed and how u solved this problem.. 解决过很多疑难bug。最困难的分为两类。一类是并发、多线程类的,因为bug的出现依赖于一定的时序,难以复现;看到的是被破坏的现场。线程安全类问题很多发。 另一类是对外部 阅读全文