05 2020 档案

摘要:check if an integer array contains 132 pattern. using the monotoni... 阅读全文
posted @ 2020-05-31 12:25 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:check if an integer array contains 132 pattern. using the monotoni... 阅读全文
posted @ 2020-05-31 12:25 EvanMeetTheWorld 阅读(26) 评论(0) 推荐(0)
摘要:we are given two arrays which have length m and n with digits 0-9 ... 阅读全文
posted @ 2020-05-31 12:09 EvanMeetTheWorld 阅读(11) 评论(0) 推荐(0)
摘要:we are given two arrays which have length m and n with digits 0-9 ... 阅读全文
posted @ 2020-05-31 12:09 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:Given a non-negative integer num represented as a string, remove k... 阅读全文
posted @ 2020-05-31 09:51 EvanMeetTheWorld 阅读(15) 评论(0) 推荐(0)
摘要:Given a non-negative integer num represented as a string, remove k... 阅读全文
posted @ 2020-05-31 09:51 EvanMeetTheWorld 阅读(8) 评论(0) 推荐(0)
摘要:LC886 Possible Bipartition we are given int N, int[][] dislikes. s... 阅读全文
posted @ 2020-05-31 09:14 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:LC886 Possible Bipartition we are given int N, int[][] dislikes. s... 阅读全文
posted @ 2020-05-31 09:14 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
摘要:method1, which is pretty simple, in order tranverse method2, which... 阅读全文
posted @ 2020-05-31 06:46 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:method1, which is pretty simple, in order tranverse method2, which... 阅读全文
posted @ 2020-05-31 06:46 EvanMeetTheWorld 阅读(14) 评论(0) 推荐(0)
摘要:this problem is really classic and we have a really classic way to... 阅读全文
posted @ 2020-05-26 13:10 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
摘要:this problem is really classic and we have a really classic way to... 阅读全文
posted @ 2020-05-26 13:10 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
摘要:very easy to understand problem: Given n non-negative integers rep... 阅读全文
posted @ 2020-05-26 12:43 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:very easy to understand problem: Given n non-negative integers rep... 阅读全文
posted @ 2020-05-26 12:43 EvanMeetTheWorld 阅读(15) 评论(0) 推荐(0)
摘要:LC496 Next Greater Element Series1: given two arrays, nums1 and nu... 阅读全文
posted @ 2020-05-26 11:40 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:LC496 Next Greater Element Series1: given two arrays, nums1 and nu... 阅读全文
posted @ 2020-05-26 11:40 EvanMeetTheWorld 阅读(17) 评论(0) 推荐(0)
摘要:this is a problem related to mono stack. and the problem is pretty... 阅读全文
posted @ 2020-05-26 09:22 EvanMeetTheWorld 阅读(27) 评论(0) 推荐(0)
摘要:this is a problem related to mono stack. and the problem is pretty... 阅读全文
posted @ 2020-05-26 09:22 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:this is a kinds of strange problem, after you understand what this... 阅读全文
posted @ 2020-05-26 08:17 EvanMeetTheWorld 阅读(26) 评论(0) 推荐(0)
摘要:this is a kinds of strange problem, after you understand what this... 阅读全文
posted @ 2020-05-26 08:17 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:We write the integers of A and B (in the order they are given) on ... 阅读全文
posted @ 2020-05-25 23:48 EvanMeetTheWorld 阅读(14) 评论(0) 推荐(0)
摘要:We write the integers of A and B (in the order they are given) on ... 阅读全文
posted @ 2020-05-25 23:48 EvanMeetTheWorld 阅读(25) 评论(0) 推荐(0)
摘要:Given an array of integers A, consider all non-empty subsequences ... 阅读全文
posted @ 2020-05-25 06:34 EvanMeetTheWorld 阅读(15) 评论(0) 推荐(0)
摘要:Given an array of integers A, consider all non-empty subsequences ... 阅读全文
posted @ 2020-05-25 06:34 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
摘要:this problem is belongs to one of the problems of my article: Mono... 阅读全文
posted @ 2020-05-25 04:18 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:this problem is belongs to one of the problems of my article: Mono... 阅读全文
posted @ 2020-05-25 04:18 EvanMeetTheWorld 阅读(25) 评论(0) 推荐(0)
摘要:Decode WaysUnique PathsClimbing Stairs Unique Path and climbing st... 阅读全文
posted @ 2020-05-25 02:35 EvanMeetTheWorld 阅读(10) 评论(0) 推荐(0)
摘要:Decode WaysUnique PathsClimbing Stairs Unique Path and climbing st... 阅读全文
posted @ 2020-05-25 02:35 EvanMeetTheWorld 阅读(9) 评论(0) 推荐(0)
摘要:091 decode ways: given a number String, return the number of uniqu... 阅读全文
posted @ 2020-05-25 02:33 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:091 decode ways: given a number String, return the number of uniqu... 阅读全文
posted @ 2020-05-25 02:33 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)
摘要:问题描述:给定一个长度为m的区间,再给出n条线段的起点和终点(注意这里是闭区间),求最少使用多少条线段可以将整个区间完全覆盖。 思路... 阅读全文
posted @ 2020-05-20 05:08 EvanMeetTheWorld 阅读(34) 评论(0) 推荐(0)
摘要:问题描述:给定一个长度为m的区间,再给出n条线段的起点和终点(注意这里是闭区间),求最少使用多少条线段可以将整个区间完全覆盖。 思路... 阅读全文
posted @ 2020-05-20 05:08 EvanMeetTheWorld 阅读(63) 评论(0) 推荐(0)
摘要:find the first number index that is larger or equals to target. (就... 阅读全文
posted @ 2020-05-20 04:21 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:find the first number index that is larger or equals to target. (就... 阅读全文
posted @ 2020-05-20 04:21 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:classic monotonic stack problem, and this is a monotonic increasin... 阅读全文
posted @ 2020-05-20 03:22 EvanMeetTheWorld 阅读(9) 评论(0) 推荐(0)
摘要:classic monotonic stack problem, and this is a monotonic increasin... 阅读全文
posted @ 2020-05-20 03:22 EvanMeetTheWorld 阅读(12) 评论(0) 推荐(0)
摘要:even though those two things are pretty similar by the names, they... 阅读全文
posted @ 2020-05-17 13:52 EvanMeetTheWorld 阅读(22) 评论(0) 推荐(0)
摘要:even though those two things are pretty similar by the names, they... 阅读全文
posted @ 2020-05-17 13:52 EvanMeetTheWorld 阅读(9) 评论(0) 推荐(0)
摘要:SubArray Related Problem: LeetCode 152: Maximum Product subarray: ... 阅读全文
posted @ 2020-05-17 09:13 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)
摘要:SubArray Related Problem: LeetCode 152: Maximum Product subarray: ... 阅读全文
posted @ 2020-05-17 09:13 EvanMeetTheWorld 阅读(27) 评论(0) 推荐(0)
摘要:Check if contains a subarray that sum up equals to times of k and ... 阅读全文
posted @ 2020-05-17 09:10 EvanMeetTheWorld 阅读(23) 评论(0) 推荐(0)
摘要:Check if contains a subarray that sum up equals to times of k and ... 阅读全文
posted @ 2020-05-17 09:10 EvanMeetTheWorld 阅读(12) 评论(0) 推荐(0)
摘要:Given an integer array, find three numbers whose product is maximu... 阅读全文
posted @ 2020-05-17 08:20 EvanMeetTheWorld 阅读(17) 评论(0) 推荐(0)
摘要:Given an integer array, find three numbers whose product is maximu... 阅读全文
posted @ 2020-05-17 08:20 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)
摘要:Given two integer arrays A and B, return the maximum length of an ... 阅读全文
posted @ 2020-05-17 07:53 EvanMeetTheWorld 阅读(10) 评论(0) 推荐(0)
摘要:Given two integer arrays A and B, return the maximum length of an ... 阅读全文
posted @ 2020-05-17 07:53 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:this problem is actually a lot like LC907 Sum of subarray minimums... 阅读全文
posted @ 2020-05-17 05:39 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:this problem is actually a lot like LC907 Sum of subarray minimums... 阅读全文
posted @ 2020-05-17 05:39 EvanMeetTheWorld 阅读(39) 评论(0) 推荐(0)
摘要:we use to solve the problem of get the shortest subarray with sum ... 阅读全文
posted @ 2020-05-17 04:01 EvanMeetTheWorld 阅读(28) 评论(0) 推荐(0)
摘要:we use to solve the problem of get the shortest subarray with sum ... 阅读全文
posted @ 2020-05-17 04:01 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:we need to count the number of subarray of a given array that the ... 阅读全文
posted @ 2020-05-16 15:05 EvanMeetTheWorld 阅读(12) 评论(0) 推荐(0)
摘要:we need to count the number of subarray of a given array that the ... 阅读全文
posted @ 2020-05-16 15:05 EvanMeetTheWorld 阅读(22) 评论(0) 推荐(0)
摘要:so now we need to return the shortest length which satified >= giv... 阅读全文
posted @ 2020-05-16 14:29 EvanMeetTheWorld 阅读(15) 评论(0) 推荐(0)
摘要:so now we need to return the shortest length which satified >= giv... 阅读全文
posted @ 2020-05-16 14:29 EvanMeetTheWorld 阅读(17) 评论(0) 推荐(0)
摘要:Given an array nums and a target value k, find the maximum length ... 阅读全文
posted @ 2020-05-16 13:35 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
摘要:Given an array nums and a target value k, find the maximum length ... 阅读全文
posted @ 2020-05-16 13:35 EvanMeetTheWorld 阅读(14) 评论(0) 推荐(0)
摘要:find the sum of (all the subarray’s minimum element) of a given ar... 阅读全文
posted @ 2020-05-16 11:57 EvanMeetTheWorld 阅读(9) 评论(0) 推荐(0)
摘要:find the sum of (all the subarray’s minimum element) of a given ar... 阅读全文
posted @ 2020-05-16 11:57 EvanMeetTheWorld 阅读(12) 评论(0) 推荐(0)
摘要:classic dp: dp[i] represents the maximum sum of subarray which end... 阅读全文
posted @ 2020-05-16 06:10 EvanMeetTheWorld 阅读(11) 评论(0) 推荐(0)
摘要:classic dp: dp[i] represents the maximum sum of subarray which end... 阅读全文
posted @ 2020-05-16 06:10 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:it’s very similar to LC53 Maximum Sum Subarray. but in this case, ... 阅读全文
posted @ 2020-05-16 06:02 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)
摘要:it’s very similar to LC53 Maximum Sum Subarray. but in this case, ... 阅读全文
posted @ 2020-05-16 06:02 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:we are given a directed weighted graph, and we know that the node ... 阅读全文
posted @ 2020-05-15 11:08 EvanMeetTheWorld 阅读(27) 评论(0) 推荐(0)
摘要:we are given a directed weighted graph, and we know that the node ... 阅读全文
posted @ 2020-05-15 11:08 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:this time, we will be given a directed graph, and we need to find ... 阅读全文
posted @ 2020-05-13 04:26 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:this time, we will be given a directed graph, and we need to find ... 阅读全文
posted @ 2020-05-13 04:26 EvanMeetTheWorld 阅读(12) 评论(0) 推荐(0)
摘要:this problem is not a regualr one, but we can see it in graph righ... 阅读全文
posted @ 2020-05-12 09:51 EvanMeetTheWorld 阅读(10) 评论(0) 推荐(0)
摘要:this problem is not a regualr one, but we can see it in graph righ... 阅读全文
posted @ 2020-05-12 09:51 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:Given the edges of a directed graph, and two nodes source and dest... 阅读全文
posted @ 2020-05-12 04:54 EvanMeetTheWorld 阅读(23) 评论(0) 推荐(0)
摘要:Given the edges of a directed graph, and two nodes source and dest... 阅读全文
posted @ 2020-05-12 04:54 EvanMeetTheWorld 阅读(14) 评论(0) 推荐(0)
摘要:Check whether the original sequence org can be uniquely reconstruc... 阅读全文
posted @ 2020-05-11 10:52 EvanMeetTheWorld 阅读(17) 评论(0) 推荐(0)
摘要:Check whether the original sequence org can be uniquely reconstruc... 阅读全文
posted @ 2020-05-11 10:52 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:399 Evaluate Division: this question seems pretty odd for being ca... 阅读全文
posted @ 2020-05-10 11:11 EvanMeetTheWorld 阅读(15) 评论(0) 推荐(0)
摘要:399 Evaluate Division: this question seems pretty odd for being ca... 阅读全文
posted @ 2020-05-10 11:11 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:find the smallest lexicographic order of a valid plane tickets ord... 阅读全文
posted @ 2020-05-10 04:08 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
摘要:find the smallest lexicographic order of a valid plane tickets ord... 阅读全文
posted @ 2020-05-10 04:08 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:Input: n = 5 and edges = [[0, 1], [1, 2], [3, 4]] 0 3 | ... 阅读全文
posted @ 2020-05-08 12:16 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:Input: n = 5 and edges = [[0, 1], [1, 2], [3, 4]] 0 3 | ... 阅读全文
posted @ 2020-05-08 12:16 EvanMeetTheWorld 阅读(18) 评论(0) 推荐(0)
摘要:we have an undirected graph, we can choose any node as root. now, ... 阅读全文
posted @ 2020-05-08 11:01 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:we have an undirected graph, we can choose any node as root. now, ... 阅读全文
posted @ 2020-05-08 11:01 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:given you a list of instance, find the pattern and return it. exam... 阅读全文
posted @ 2020-05-08 04:10 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:given you a list of instance, find the pattern and return it. exam... 阅读全文
posted @ 2020-05-08 04:10 EvanMeetTheWorld 阅读(28) 评论(0) 推荐(0)
摘要:Given n nodes labeled from 0 to n-1 and a list of undirected edges... 阅读全文
posted @ 2020-05-07 10:21 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:Given n nodes labeled from 0 to n-1 and a list of undirected edges... 阅读全文
posted @ 2020-05-07 10:21 EvanMeetTheWorld 阅读(15) 评论(0) 推荐(0)
摘要:首先我们来谈一下之前没有了解过的方面: JVM: 什么是JVM? 我知道 JVM就是JavaVirtualMachine.就像是实体... 阅读全文
posted @ 2020-05-07 05:13 EvanMeetTheWorld 阅读(30) 评论(0) 推荐(0)
摘要:首先我们来谈一下之前没有了解过的方面: JVM: 什么是JVM? 我知道 JVM就是JavaVirtualMachine.就像是实体... 阅读全文
posted @ 2020-05-07 05:13 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:这个领域之前有涉足过,但是由于要消化的东西过多,因此难以理解。现在就要必须强制自己做理解了。 reference: https://... 阅读全文
posted @ 2020-05-07 05:12 EvanMeetTheWorld 阅读(29) 评论(0) 推荐(0)
摘要:这个领域之前有涉足过,但是由于要消化的东西过多,因此难以理解。现在就要必须强制自己做理解了。 reference: https://... 阅读全文
posted @ 2020-05-07 05:12 EvanMeetTheWorld 阅读(28) 评论(0) 推荐(0)
摘要:https://leetcode.com/problems/reverse-pairs/discuss/97268/General-... 阅读全文
posted @ 2020-05-06 07:53 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:https://leetcode.com/problems/reverse-pairs/discuss/97268/General-... 阅读全文
posted @ 2020-05-06 07:53 EvanMeetTheWorld 阅读(17) 评论(0) 推荐(0)
摘要:very easy yo understand the problem: Given an array nums, we call ... 阅读全文
posted @ 2020-05-06 06:10 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:very easy yo understand the problem: Given an array nums, we call ... 阅读全文
posted @ 2020-05-06 06:10 EvanMeetTheWorld 阅读(13) 评论(0) 推荐(0)
摘要:LC476 Number Complement the following is very low, but it worked: ... 阅读全文
posted @ 2020-05-05 01:24 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:LC476 Number Complement the following is very low, but it worked: ... 阅读全文
posted @ 2020-05-05 01:24 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:just search trie LC208: Implement Tree LC211: Add and Search Word-... 阅读全文
posted @ 2020-05-04 10:47 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:just search trie LC208: Implement Tree LC211: Add and Search Word-... 阅读全文
posted @ 2020-05-04 10:47 EvanMeetTheWorld 阅读(25) 评论(0) 推荐(0)
摘要:I solved this using pq, but this problem is actually very much ali... 阅读全文
posted @ 2020-05-04 10:45 EvanMeetTheWorld 阅读(22) 评论(0) 推荐(0)
摘要:I solved this using pq, but this problem is actually very much ali... 阅读全文
posted @ 2020-05-04 10:45 EvanMeetTheWorld 阅读(28) 评论(0) 推荐(0)
摘要:classic Trie problem. there are few points we should fully unders... 阅读全文
posted @ 2020-05-03 11:53 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:classic Trie problem. there are few points we should fully unders... 阅读全文
posted @ 2020-05-03 11:53 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)
摘要:Given a list of words (without duplicates), please write a program... 阅读全文
posted @ 2020-05-03 09:39 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)
摘要:Given a list of words (without duplicates), please write a program... 阅读全文
posted @ 2020-05-03 09:39 EvanMeetTheWorld 阅读(19) 评论(0) 推荐(0)
摘要:this problem remains me of soduku problem, because take a quick lo... 阅读全文
posted @ 2020-05-03 04:32 EvanMeetTheWorld 阅读(15) 评论(0) 推荐(0)
摘要:this problem remains me of soduku problem, because take a quick lo... 阅读全文
posted @ 2020-05-03 04:32 EvanMeetTheWorld 阅读(32) 评论(0) 推荐(0)
摘要:字典树(前缀树): Leetcode208 Implement Trie: class Trie { TrieNode... 阅读全文
posted @ 2020-05-02 04:46 EvanMeetTheWorld 阅读(16) 评论(0) 推荐(0)
摘要:字典树(前缀树): Leetcode208 Implement Trie: class Trie { TrieNode... 阅读全文
posted @ 2020-05-02 04:46 EvanMeetTheWorld 阅读(20) 评论(0) 推荐(0)
摘要:refer: 程序员内功修炼1.0 Problem1: given two sorted arrays with the same ... 阅读全文
posted @ 2020-05-01 09:51 EvanMeetTheWorld 阅读(11) 评论(0) 推荐(0)
摘要:refer: 程序员内功修炼1.0 Problem1: given two sorted arrays with the same ... 阅读全文
posted @ 2020-05-01 09:51 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)