-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcontent.json
1 lines (1 loc) · 55.1 KB
/
content.json
1
[{"title":"9021_TUT_3_25T1","date":"2025-03-06T13:00:00.000Z","path":"post/974decd3.html","excerpt":"","tags":[{"name":"9021","slug":"9021","permalink":"https://longsizhuo.github.io/tags/9021/"},{"name":"lab","slug":"lab","permalink":"https://longsizhuo.github.io/tags/lab/"}]},{"title":"9021_TUT_2","date":"2025-03-03T04:38:00.058Z","path":"post/becdc081.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"}]},{"title":"9021_TUT_1_25T1","date":"2025-03-03T04:38:00.024Z","path":"post/b9bbc455.html","excerpt":"","tags":[{"name":"“9021”","slug":"“9021”","permalink":"https://longsizhuo.github.io/tags/%E2%80%9C9021%E2%80%9D/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"},{"name":"Lab","slug":"Lab","permalink":"https://longsizhuo.github.io/tags/Lab/"}]},{"title":"9021_TUT_2_25T1","date":"2025-02-02T13:00:00.000Z","path":"post/8036f890.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"}]},{"title":"Windows7+SSH","date":"2025-01-23T16:29:53.890Z","path":"post/60f249e3.html","excerpt":"","tags":[{"name":"SSH","slug":"SSH","permalink":"https://longsizhuo.github.io/tags/SSH/"}]},{"title":"Lattice","date":"2025-01-20T07:37:28.321Z","path":"post/49e7fe92.html","excerpt":"","tags":[]},{"title":"MyCalendar","date":"2025-01-20T07:37:28.171Z","path":"post/9a3257a2.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"},{"name":"Prefix Sum","slug":"Prefix-Sum","permalink":"https://longsizhuo.github.io/tags/Prefix-Sum/"},{"name":"Binary Search","slug":"Binary-Search","permalink":"https://longsizhuo.github.io/tags/Binary-Search/"},{"name":"Design","slug":"Design","permalink":"https://longsizhuo.github.io/tags/Design/"},{"name":"Segment Tree","slug":"Segment-Tree","permalink":"https://longsizhuo.github.io/tags/Segment-Tree/"},{"name":"Ordered Set","slug":"Ordered-Set","permalink":"https://longsizhuo.github.io/tags/Ordered-Set/"}]},{"title":"2270. Number of Ways to Split Array","date":"2025-01-13T22:31:00.000Z","path":"post/c25bb550.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"}]},{"title":"post-gu","date":"2025-01-08T13:14:00.000Z","path":"post/c87ff78a.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answerhe","slug":"Answerhe","permalink":"https://longsizhuo.github.io/tags/Answerhe/"}]},{"title":"2241. Design an ATM Machine","date":"2025-01-06T00:00:00.000Z","path":"post/a21411f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"}]},{"title":"3046. Split the Array","date":"2024-12-30T10:23:08.034Z","path":"post/41577de2.html","excerpt":"","tags":[]},{"title":"3138. Minimum Length of Anagram Concatenation","date":"2024-12-30T10:23:08.032Z","path":"post/d1339d55.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Hash Table","slug":"Hash-Table","permalink":"https://longsizhuo.github.io/tags/Hash-Table/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"},{"name":"Counting","slug":"Counting","permalink":"https://longsizhuo.github.io/tags/Counting/"},{"name":"Prefix Sum","slug":"Prefix-Sum","permalink":"https://longsizhuo.github.io/tags/Prefix-Sum/"}]},{"title":"1366. Rank Teams by Votes","date":"2024-12-30T10:23:07.791Z","path":"post/3ab349b3.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Hash Table","slug":"Hash-Table","permalink":"https://longsizhuo.github.io/tags/Hash-Table/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"},{"name":"Counting","slug":"Counting","permalink":"https://longsizhuo.github.io/tags/Counting/"},{"name":"Sorting","slug":"Sorting","permalink":"https://longsizhuo.github.io/tags/Sorting/"}]},{"title":"3159. Find Occurrences of an Element in an Array","date":"2024-12-28T08:22:07.811Z","path":"post/aec413e2.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Hash Table","slug":"Hash-Table","permalink":"https://longsizhuo.github.io/tags/Hash-Table/"}]},{"title":"9021_TUT_7","date":"2024-11-11T05:54:50.386Z","path":"post/891330b3.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"},{"name":"9021","slug":"9021","permalink":"https://longsizhuo.github.io/tags/9021/"}]},{"title":"9021_TUT_6","date":"2024-11-11T05:54:50.340Z","path":"post/31af57d6.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"9021","slug":"9021","permalink":"https://longsizhuo.github.io/tags/9021/"}]},{"title":"9021_TUT_9","date":"2024-11-10T13:00:00.000Z","path":"post/69cc4780.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"},{"name":"9021","slug":"9021","permalink":"https://longsizhuo.github.io/tags/9021/"}]},{"title":"9021_TUT_8","date":"2024-11-04T13:00:00.000Z","path":"post/d17020e5.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"},{"name":"9021","slug":"9021","permalink":"https://longsizhuo.github.io/tags/9021/"}]},{"title":"9021_TUT_5","date":"2024-10-07T13:00:00.000Z","path":"post/231af838.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"9021","slug":"9021","permalink":"https://longsizhuo.github.io/tags/9021/"},{"name":"TUT","slug":"TUT","permalink":"https://longsizhuo.github.io/tags/TUT/"}]},{"title":"9021_TUT_3_25T1","date":"2024-09-24T07:26:52.240Z","path":"post/671a7e4.html","excerpt":"","tags":[{"name":"9021","slug":"9021","permalink":"https://longsizhuo.github.io/tags/9021/"},{"name":"lab","slug":"lab","permalink":"https://longsizhuo.github.io/tags/lab/"}]},{"title":"Counting Stars-Inter-Uni Programming Contest","date":"2024-09-21T15:45:02.606Z","path":"post/a29b0a05.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Contest","slug":"Contest","permalink":"https://longsizhuo.github.io/tags/Contest/"},{"name":"Binary Search","slug":"Binary-Search","permalink":"https://longsizhuo.github.io/tags/Binary-Search/"}]},{"title":"Horse Racing-Inter-Uni Programming Contest","date":"2024-09-21T12:38:58.316Z","path":"post/7ab03a1b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Contest","slug":"Contest","permalink":"https://longsizhuo.github.io/tags/Contest/"}]},{"title":"DartsInter-Uni Programming Contest Tasks Leaderboard Contest","date":"2024-09-20T14:00:00.000Z","path":"post/c61e596.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"},{"name":"Contest","slug":"Contest","permalink":"https://longsizhuo.github.io/tags/Contest/"},{"name":"Inter-Uni Programming Contest","slug":"Inter-Uni-Programming-Contest","permalink":"https://longsizhuo.github.io/tags/Inter-Uni-Programming-Contest/"}]},{"title":"Top of an article","date":"2024-09-10T15:11:32.940Z","path":"post/edc2b94.html","excerpt":"","tags":[{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"front end","slug":"front-end","permalink":"https://longsizhuo.github.io/tags/front-end/"}]},{"title":"9021_TUT_1","date":"2024-09-10T14:00:00.000Z","path":"post/ac786f6f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Tutorial","slug":"Tutorial","permalink":"https://longsizhuo.github.io/tags/Tutorial/"}]},{"title":"964E","date":"2024-08-06T17:34:00.000Z","path":"post/2280b647.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Answer","slug":"Answer","permalink":"https://longsizhuo.github.io/tags/Answer/"}]},{"title":"56. Merge Intervals","date":"2024-05-27T13:48:54.582Z","path":"post/50818339.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"数组","slug":"数组","permalink":"https://longsizhuo.github.io/tags/%E6%95%B0%E7%BB%84/"},{"name":"排序","slug":"排序","permalink":"https://longsizhuo.github.io/tags/%E6%8E%92%E5%BA%8F/"}]},{"title":"994.Rotten orange","date":"2024-05-13T14:00:00.000Z","path":"post/56e64fdd.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"BFS","slug":"BFS","permalink":"https://longsizhuo.github.io/tags/BFS/"},{"name":"Bilateral queue","slug":"Bilateral-queue","permalink":"https://longsizhuo.github.io/tags/Bilateral-queue/"}]},{"title":"1017. Negative binary conversion","date":"2023-12-31T13:00:00.000Z","path":"post/dce95dce.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1138. The path on the letter board One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/fd471847.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1124. The longest period of performance One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/a5d1dfda.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"}]},{"title":"1139. The greatest 1 Formation of the border One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/eb193c1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"}]},{"title":"1233Delete the subfolder folder One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/6610c769.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dictionary tree","slug":"Dictionary-tree","permalink":"https://longsizhuo.github.io/tags/Dictionary-tree/"}]},{"title":"1017.Negative binary conversion","date":"2023-12-31T13:00:00.000Z","path":"post/80cafdc8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1234. Replace the sub -string to get a balanced string One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/56d97dcf.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1237. Find out the positive combination of the given square One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/14b94db7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1250. examine「Good array」 One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/435a9a0d.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"1551. Make all the minimum operations of all elements in the array","date":"2023-12-31T13:00:00.000Z","path":"post/b2a927d5.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"1590.Make the array and energyPDivide","date":"2023-12-31T13:00:00.000Z","path":"post/59825e1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1604Warn alert person who uses the same employee card within one hour One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/bb7bcf54.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"}]},{"title":"1653. The minimum number of times to balance the string balance","date":"2023-12-31T13:00:00.000Z","path":"post/cac21f27.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"142.Ring linkedII","date":"2023-12-31T13:00:00.000Z","path":"post/e2c9cca9.html","excerpt":"142.Ring listII.md Thought：Problem -solving：这类Linkedtopic一般都yes使用双pointer法解决的，For example, looking for distance tail K Node、Find a ring entrance、Find the entrance of the public tail, etc.。 Algorithm： Double pointer met for the first time： Set two pointers fast，slow 指向Linked头部 head，fast Walk per round 2 step，slow Walk per round 1 step； a. First result： fast pointer走过Linked末端，说明Linked无环，直接return null； .TIPS: If there is a ring，Two pointers will definitely meet。Because every time I go 1 wheel，fast and slow Pitch +1，fast The event will catch up slow； b. Second result： whenfast == slowhour， Two pointers in the ring First encounter 。下面分析此hourfast and slowPassing step数关系 ： .设Linked共have a+b Node，in Linked头部到Linked入口 have a Node（不计Linked入口节点）， Linked环 have b Node（这里需要Notice，a and b yes未知数，例如图解上Linked a=4 , b=5）；Set two pointers分别走了 f，s step，则have： a. fast 走的step数yesslowstep数的 2 Double，Right now f=2s；（Analyze： fast Walk per round 2 step） b.fast Compare slowGo more n Length of a ring，Right now f=s+nb；（ Analyze： Double pointers have gone through a step，然后在环Inside绕圈直到重合，重合hour fast Compare slow Go 环的长度整数Double ）； .The above two types are reduced：f=2nb，s=nb，Right nowfastandslow The pointer left separately 2n，n indivual Circumference of the ring （Notice： n yes未知数，不同Linked的情况不同）。","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"1663. The smallest string with a given value One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/4d7252f8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"}]},{"title":"1664. Number of schemes to generate balance numbers One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/1978f474.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"}]},{"title":"1669. Merge two linked watches One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/d482ac75.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"}]},{"title":"1801-1803 Liech buckle novice！","date":"2023-12-31T13:00:00.000Z","path":"post/2f3e8e26.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"1813. Sentence similarity III","date":"2023-12-31T13:00:00.000Z","path":"post/69c2a1dd.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"}]},{"title":"1798You can construct the maximum number of continuity One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/3667cd44.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"1814. Statistics the number of good pairs in an array One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/ceb1e67f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"1817. Find the number of users of users active One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/d0a9337b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"}]},{"title":"1819.Different numbers in the sequence","date":"2023-12-31T13:00:00.000Z","path":"post/de522cea.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"1825. Seek out MK average value","date":"2023-12-31T13:00:00.000Z","path":"post/6be57ef7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"},{"name":"Graph Theory","slug":"Graph-Theory","permalink":"https://longsizhuo.github.io/tags/Graph-Theory/"}]},{"title":"1828. Statistics the number of a circle mid -point One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/3277549c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"1825. Seek out MK average value","date":"2023-12-31T13:00:00.000Z","path":"post/6be57ef7.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"},{"name":"Multiple set","slug":"Multiple-set","permalink":"https://longsizhuo.github.io/tags/Multiple-set/"}]},{"title":"19.Delete the countdown of the linked listNNode","date":"2023-12-31T13:00:00.000Z","path":"post/c916b663.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"PythonCoincidence，Random algorithmO(nlogn)Push","date":"2023-12-31T13:00:00.000Z","path":"post/a1d26db4.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"217. Existing duplicate elements C++/Python3","date":"2023-12-31T13:00:00.000Z","path":"post/717042a6.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"}]},{"title":"209.Small length array","date":"2023-12-31T13:00:00.000Z","path":"post/e6227611.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"219.Existing duplicate elements II Hash table graphics","date":"2023-12-31T13:00:00.000Z","path":"post/16b0e9f1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"221Maximum square","date":"2023-12-31T13:00:00.000Z","path":"post/e03edda.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"217. Existing duplicate elements C++/Python3","date":"2023-12-31T13:00:00.000Z","path":"post/717042a6.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"}]},{"title":"One question daily 2283","date":"2023-12-31T13:00:00.000Z","path":"post/c3f7f59f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"One question daily 2293. Great mini game","date":"2023-12-31T13:00:00.000Z","path":"post/9df6242c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"One question daily 2299. Code inspection device II","date":"2023-12-31T13:00:00.000Z","path":"post/7ded25bb.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2303. Calculate the total taxable amount","date":"2023-12-31T13:00:00.000Z","path":"post/11597f8b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"}]},{"title":"2309. The best English letters with both appropriates and lowercases One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/b4953d62.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"C++","slug":"C","permalink":"https://longsizhuo.github.io/tags/C/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2315. Statistical star number One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/dc8d7590.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"}]},{"title":"2319Determine whether the matrix is one X matrix One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f7c5db77.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2325Decrypt One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f4b99a74.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"2335. The shortest total time to be filled with a cup One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/4400daa1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"One question daily","slug":"One-question-daily","permalink":"https://longsizhuo.github.io/tags/One-question-daily/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"},{"name":"dp","slug":"dp","permalink":"https://longsizhuo.github.io/tags/dp/"}]},{"title":"2331Calculate the value of the Boolean binary tree One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/a564ea0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"}]},{"title":"2341. How much can the array be formed One question daily","date":"2023-12-31T13:00:00.000Z","path":"post/f953c753.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"24.Two or two exchanges linked watches","date":"2023-12-31T13:00:00.000Z","path":"post/d030a5a0.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2527.Query arrayXorBeautiful value Zhou Sai Third Question","date":"2023-12-31T13:00:00.000Z","path":"post/20ffa67a.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"2639. Query the width of each column in the grid diagram","date":"2023-12-31T13:00:00.000Z","path":"post/5a764983.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2679.In the matrix and the harmony","date":"2023-12-31T13:00:00.000Z","path":"post/5277100.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"heap（Priority queue）","slug":"heap（Priority-queue）","permalink":"https://longsizhuo.github.io/tags/heap%EF%BC%88Priority-queue%EF%BC%89/"}]},{"title":"271. Code and decoding of string - Python Add the transposition symbol solution method Dual complexityO(n)","date":"2023-12-31T13:00:00.000Z","path":"post/5992f238.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"2997. Make an array or harmony K The minimum number of operations","date":"2023-12-31T13:00:00.000Z","path":"post/3109a910.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"},{"name":"Bit operation","slug":"Bit-operation","permalink":"https://longsizhuo.github.io/tags/Bit-operation/"}]},{"title":"2998. make X and Y Equal number of operations","date":"2023-12-31T13:00:00.000Z","path":"post/5ee4164.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"Memory search","slug":"Memory-search","permalink":"https://longsizhuo.github.io/tags/Memory-search/"}]},{"title":"3072. Allocate elements into two arrays II","date":"2023-12-31T13:00:00.000Z","path":"post/48a38683.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"Tree array","slug":"Tree-array","permalink":"https://longsizhuo.github.io/tags/Tree-array/"},{"name":"Thread tree","slug":"Thread-tree","permalink":"https://longsizhuo.github.io/tags/Thread-tree/"}]},{"title":"345. Voice letter in the reverse string","date":"2023-12-31T13:00:00.000Z","path":"post/1c57c22c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"350.The intersection of two array","date":"2023-12-31T13:00:00.000Z","path":"post/616577aa.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"}]},{"title":"445.Two numbersII","date":"2023-12-31T13:00:00.000Z","path":"post/2c4cc46c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"recursion","slug":"recursion","permalink":"https://longsizhuo.github.io/tags/recursion/"},{"name":"Stack","slug":"Stack","permalink":"https://longsizhuo.github.io/tags/Stack/"}]},{"title":"538.Convert the binary search tree to cumulative tree","date":"2023-12-31T13:00:00.000Z","path":"post/32401b69.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"}]},{"title":"6275. Make all the minimum operations of all elements in the array II","date":"2023-12-31T13:00:00.000Z","path":"post/4e14482b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"6293. Count the number of good array","date":"2023-12-31T13:00:00.000Z","path":"post/81004405.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"unsolved","slug":"unsolved","permalink":"https://longsizhuo.github.io/tags/unsolved/"}]},{"title":"6300. Minimum public value","date":"2023-12-31T13:00:00.000Z","path":"post/fefe18d8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6324. Maximize the great value of the array","date":"2023-12-31T13:00:00.000Z","path":"post/1e6b72b8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6323. Child that divides money the most","date":"2023-12-31T13:00:00.000Z","path":"post/b9130c0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6331The most prizes won in the two lines make()usage","date":"2023-12-31T13:00:00.000Z","path":"post/14d9382b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"golang","slug":"golang","permalink":"https://longsizhuo.github.io/tags/golang/"}]},{"title":"6347Number of vowel string within the scope of statistics","date":"2023-12-31T13:00:00.000Z","path":"post/52923acb.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"6338. Number of methods of monkey collision Weekly","date":"2023-12-31T13:00:00.000Z","path":"post/2aa720ec.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Fast power","slug":"Fast-power","permalink":"https://longsizhuo.github.io/tags/Fast-power/"},{"name":"Weekly","slug":"Weekly","permalink":"https://longsizhuo.github.io/tags/Weekly/"}]},{"title":"6351. The scores of the array after the marking all elements","date":"2023-12-31T13:00:00.000Z","path":"post/20116270.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"76Minimum cover string","date":"2023-12-31T13:00:00.000Z","path":"post/ae10d3c1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"704. Two -point search","date":"2023-12-31T13:00:00.000Z","path":"post/41f30363.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Python beat98.40% collectionsofCounter method！","date":"2023-12-31T13:00:00.000Z","path":"post/73b5ce9c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]},{"title":"977.Orderly array square","date":"2023-12-31T13:00:00.000Z","path":"post/a386fcdc.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Sword finger Offer 43. 1～n Integer 1 Number of times","date":"2023-12-31T13:00:00.000Z","path":"post/f0d96a1f.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"solved","slug":"solved","permalink":"https://longsizhuo.github.io/tags/solved/"},{"name":"difficulty","slug":"difficulty","permalink":"https://longsizhuo.github.io/tags/difficulty/"}]},{"title":"121.The best time for buying and selling stocks","date":"2023-12-31T13:00:00.000Z","path":"post/3a21fe32.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"}]},{"title":"1222.Can attack the queen of the king","date":"2023-12-31T13:00:00.000Z","path":"post/a6577367.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"122.The best time for buying and selling stocksII","date":"2023-12-31T13:00:00.000Z","path":"post/a75da5a.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"1460.Class ScheduleIV","date":"2023-12-31T13:00:00.000Z","path":"post/d8b8a149.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"},{"name":"picture","slug":"picture","permalink":"https://longsizhuo.github.io/tags/picture/"},{"name":"Topology","slug":"Topology","permalink":"https://longsizhuo.github.io/tags/Topology/"}]},{"title":"1253.Reconstruct 2 Line binary matrix","date":"2023-12-31T13:00:00.000Z","path":"post/5c98e66b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"},{"name":"medium","slug":"medium","permalink":"https://longsizhuo.github.io/tags/medium/"}]},{"title":"1333.Restaurant filter","date":"2023-12-31T13:00:00.000Z","path":"post/7f1331bc.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"}]},{"title":"213.Hiccup II","date":"2023-12-31T13:00:00.000Z","path":"post/85beb0bf.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"}]},{"title":"2251.The number of flowers during the flowering period","date":"2023-12-31T13:00:00.000Z","path":"post/3a21fe32.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Prefix and","slug":"Prefix-and","permalink":"https://longsizhuo.github.io/tags/Prefix-and/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Sort","slug":"Sort","permalink":"https://longsizhuo.github.io/tags/Sort/"},{"name":"Two -point search","slug":"Two-point-search","permalink":"https://longsizhuo.github.io/tags/Two-point-search/"},{"name":"Orderly collection","slug":"Orderly-collection","permalink":"https://longsizhuo.github.io/tags/Orderly-collection/"}]},{"title":"146.LRU cache","date":"2023-12-31T13:00:00.000Z","path":"post/b9130c0e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"design","slug":"design","permalink":"https://longsizhuo.github.io/tags/design/"},{"name":"双向Linked","slug":"双向Linked","permalink":"https://longsizhuo.github.io/tags/%E5%8F%8C%E5%90%91Linked/"}]},{"title":"2490Return ring sentence","date":"2023-12-31T13:00:00.000Z","path":"post/5c07686c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"}]},{"title":"2562.Find the series of the array","date":"2023-12-31T13:00:00.000Z","path":"post/b625a0e1.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"Double pointer","slug":"Double-pointer","permalink":"https://longsizhuo.github.io/tags/Double-pointer/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"2591.Child that divides money the most","date":"2023-12-31T13:00:00.000Z","path":"post/6a9ab144.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"}]},{"title":"2582.Pillow","date":"2023-12-31T13:00:00.000Z","path":"post/82e09f92.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"2596.Check the Cavaliers patrol plan","date":"2023-12-31T13:00:00.000Z","path":"post/29546b92.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"matrix","slug":"matrix","permalink":"https://longsizhuo.github.io/tags/matrix/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"},{"name":"Priority search","slug":"Priority-search","permalink":"https://longsizhuo.github.io/tags/Priority-search/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"}]},{"title":"213.Hiccup III","date":"2023-12-31T13:00:00.000Z","path":"post/86590614.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Dynamic planning","slug":"Dynamic-planning","permalink":"https://longsizhuo.github.io/tags/Dynamic-planning/"},{"name":"Binary tree","slug":"Binary-tree","permalink":"https://longsizhuo.github.io/tags/Binary-tree/"},{"name":"In -depth priority search","slug":"In-depth-priority-search","permalink":"https://longsizhuo.github.io/tags/In-depth-priority-search/"},{"name":"Tree","slug":"Tree","permalink":"https://longsizhuo.github.io/tags/Tree/"}]},{"title":"2 .Two numbers","date":"2023-12-31T13:00:00.000Z","path":"post/fa9db6b8.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"},{"name":"Linked","slug":"Linked","permalink":"https://longsizhuo.github.io/tags/Linked/"},{"name":"recursion","slug":"recursion","permalink":"https://longsizhuo.github.io/tags/recursion/"}]},{"title":"630.Class ScheduleIII","date":"2023-12-31T13:00:00.000Z","path":"post/e14241e.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"greedy","slug":"greedy","permalink":"https://longsizhuo.github.io/tags/greedy/"},{"name":"Priority queue","slug":"Priority-queue","permalink":"https://longsizhuo.github.io/tags/Priority-queue/"}]},{"title":"LCP 06.Coin","date":"2023-12-31T13:00:00.000Z","path":"post/66079b7b.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"LCP 50.Gem supply","date":"2023-12-31T13:00:00.000Z","path":"post/762ca698.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"},{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"simulation","slug":"simulation","permalink":"https://longsizhuo.github.io/tags/simulation/"}]},{"title":"GOlanguage# GOlanguage可爱捏","date":"2023-12-31T13:00:00.000Z","path":"post/67fc8613.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"brief_alternate Assignment","date":"2023-12-31T13:00:00.000Z","path":"post/dbbd7d58.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"pandas","slug":"pandas","permalink":"https://longsizhuo.github.io/tags/pandas/"}]},{"title":"Inline expansion","date":"2023-12-31T13:00:00.000Z","path":"post/2660e935.html","excerpt":"","tags":[{"name":"Composition principle","slug":"Composition-principle","permalink":"https://longsizhuo.github.io/tags/Composition-principle/"}]},{"title":"math","date":"2023-12-31T13:00:00.000Z","path":"post/a927044d.html","excerpt":"like Rendering","tags":[{"name":"math","slug":"math","permalink":"https://longsizhuo.github.io/tags/math/"}]},{"title":"Some doubt","date":"2023-12-31T13:00:00.000Z","path":"post/941aeb72.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"encryption","slug":"encryption","permalink":"https://longsizhuo.github.io/tags/encryption/"}]},{"title":"Sword finger Offer 68 - II. The recent public ancestor of the binary tree","date":"2023-12-31T13:00:00.000Z","path":"post/36f314aa.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"Sword finger Offer II 021. Delete the countdown of the linked list n Node","date":"2023-12-31T13:00:00.000Z","path":"post/3ed2f01c.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"answer","slug":"answer","permalink":"https://longsizhuo.github.io/tags/answer/"}]},{"title":"2085. Public string that has occurred once","date":"2023-11-30T13:00:00.000Z","path":"post/bbe4bff6.html","excerpt":"","tags":[{"name":"Array","slug":"Array","permalink":"https://longsizhuo.github.io/tags/Array/"},{"name":"String","slug":"String","permalink":"https://longsizhuo.github.io/tags/String/"},{"name":"Hash table","slug":"Hash-table","permalink":"https://longsizhuo.github.io/tags/Hash-table/"},{"name":"count","slug":"count","permalink":"https://longsizhuo.github.io/tags/count/"}]},{"title":"1004.Maximum continuity1Number III Maximum continuity1Number III","date":"2022-12-06T14:15:00.000Z","path":"post/ed19b576.html","excerpt":"","tags":[{"name":"Python","slug":"Python","permalink":"https://longsizhuo.github.io/tags/Python/"},{"name":"solved,answer","slug":"solved-answer","permalink":"https://longsizhuo.github.io/tags/solved-answer/"}]}]