摘要: 38. Search a 2D Matrix II https://www.lintcode.com/problem/search-a-2d-matrix-ii/description?_from=ladder&&fromId=1 这道题与二分法有什么关系呢? -把整个二维数组从对角线分成两半,从左 阅读全文
posted @ 2019-04-19 04:10 Jenna777 阅读(1371) 评论(0) 推荐(0)
摘要: 254. Drop Eggs https://www.lintcode.com/problem/drop-eggs/description?_from=ladder&&fromId=1 28. Search a 2D Matrix https://www.lintcode.com/problem/s 阅读全文
posted @ 2019-04-19 00:45 Jenna777 阅读(243) 评论(0) 推荐(0)
摘要: 462. Total Occurence of Target (本质:查找 target 第一次出现的位置 + 查找 target 最后一次出现的位置) https://www.lintcode.com/problem/total-occurrence-of-target/description?_ 阅读全文
posted @ 2019-04-13 10:58 Jenna777 阅读(115) 评论(0) 推荐(0)
摘要: 159. Find Minimum in Rotate Sorted Array (本质:从一个排过序的数组中查找一个元素) https://www.lintcode.com/problem/find-minimum-in-rotated-sorted-array/description?_from 阅读全文
posted @ 2019-04-11 11:26 Jenna777 阅读(107) 评论(0) 推荐(0)
摘要: I hope you don'd mind me asking... I know I shouldn't ask, but.... - Well, before I answer that question you tell me .... - I am sorry, I really don't 阅读全文
posted @ 2019-04-10 11:01 Jenna777 阅读(394) 评论(0) 推荐(0)
摘要: 介绍项目,challenging的地方 The most challenging project I have ever done was an online collaborative coding platform, it’s like LeetCode but with collaborati 阅读全文
posted @ 2019-04-10 09:58 Jenna777 阅读(246) 评论(0) 推荐(0)
摘要: 使用二分的情况: 1.遍历时间复杂度太大 2.要从数组中找到一个元素 460. Find K Closest Elements(找到最后一个 < target 的位置) https://www.lintcode.com/problem/find-k-closest-elements/descript 阅读全文
posted @ 2019-04-10 09:46 Jenna777 阅读(137) 评论(0) 推荐(0)