2020 年 5月 16 日随笔档案 - EvanMeetTheWorld

摘要： we need to count the number of subarray of a given array that the ... 阅读全文

posted @ 2020-05-16 15:05 EvanMeetTheWorld 阅读(17) 评论(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 阅读(18) 评论(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 阅读(21) 评论(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 阅读(11) 评论(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 阅读(14) 评论(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 阅读(20) 评论(0) 推荐(0)

EvanMeetTheWorld