04 2019 档案

4 - BFS & Topological Algorithm
摘要：611. Knight Shortest Path https://www.lintcode.com/problem/knight-shortest-path/description?_from=ladder&&fromId=1 137. Clone Graph https://www.lintco 阅读全文
posted @ 2019-04-30 07:11 Jenna777 阅读(161) 评论(0) 推荐(0)
4 - BFS & Topological Algorithm
摘要：615. Course Schedule https://www.lintcode.com/problem/course-schedule/description?_from=ladder&&fromId=1 为什么不可以用 for(int[] prerequisite: prerequisites 阅读全文
posted @ 2019-04-29 06:59 Jenna777 阅读(121) 评论(0) 推荐(0)
4 - BFS & Topological Algorithm
摘要：433. Number of Islands https://www.lintcode.com/problem/number-of-islands/description?_from=ladder&&fromId=1 BFS: 69. Binary Tree Level Order Traversa 阅读全文
posted @ 2019-04-28 03:47 Jenna777 阅读(104) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：5. Kth Largest Element (quick sort的变种) https://www.lintcode.com/problem/kth-largest-element/description?_from=ladder&&fromId=1 阅读全文
posted @ 2019-04-28 01:25 Jenna777 阅读(113) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：143. Sort Colors II (quick sort 变种) https://www.lintcode.com/problem/sort-colors-ii/description?_from=ladder&&fromId=1 57. 3Sum https://www.lintcode.c 阅读全文
posted @ 2019-04-27 08:23 Jenna777 阅读(231) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：521. Remove Duplicate Numbers in Array https://www.lintcode.com/problem/remove-duplicate-numbers-in-array/description?_from=ladder&&fromId=1 总结：数组中比较 阅读全文
posted @ 2019-04-23 02:38 Jenna777 阅读(126) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：607. Two Sum III - Data structure design （查找问题：从 map 中查找一个元素） 双指针：用一个指针遍历 map 所有元素，用另一个指针在 map 中找 remain https://www.lintcode.com/problem/two-sum-iii- 阅读全文
posted @ 2019-04-21 09:00 Jenna777 阅读(101) 评论(0) 推荐(0)
3 - Two Pointers Algorithm
摘要：228. Middle of Linked List https://www.lintcode.com/problem/middle-of-linked-list/description?_from=ladder&&fromId=1 快慢指针，快指针每次走两步，慢指针每次一步。快指针到尾的时候，慢指 阅读全文
posted @ 2019-04-20 04:42 Jenna777 阅读(115) 评论(0) 推荐(0)
2 - Binary Search & LogN Algorithm - Apr 18
摘要：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 阅读(1383) 评论(0) 推荐(0)
2 - Binary Search & LogN Algorithm
摘要：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 阅读(244) 评论(0) 推荐(0)
2 - Binary Search & LogN Algorithm
摘要：462. Total Occurence of Target (本质：查找 target 第一次出现的位置 + 查找 target 最后一次出现的位置) https://www.lintcode.com/problem/total-occurrence-of-target/description?_ 阅读全文
posted @ 2019-04-13 10:58 Jenna777 阅读(117) 评论(0) 推荐(0)
2 - Binary Search & LogN Algorithm
摘要：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 阅读(111) 评论(0) 推荐(0)
Speak Confident English
摘要：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 阅读(395) 评论(0) 推荐(0)
Behavior Question - Most challenging project.
摘要：介绍项目，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 阅读(253) 评论(0) 推荐(0)
2 - Binary Search & LogN Algorithm
摘要：使用二分的情况： 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)