{"topic":{"id":7563,"title":"从零开始的 leetcode 之旅","slug":"topic","categoryId":54,"createdAt":"2023-11-27 14:55:38.444695","bumpedAt":"2024-04-09 09:52:54.871655","views":1095,"postsCount":67,"highestPostNumber":69,"likeCount":28,"closed":false,"pinned":false,"pinnedGlobally":false,"pinnedAt":null,"pinnedUntil":null,"isBanner":false,"excerpt":"从零开始，此前没有任何算法竞赛经验，没有系统刷过题","deletedAt":null,"isAnonymous":false,"category":{"id":54,"name":"学术专区","slug":"academic","color":"9EB83B"},"author":{"id":31,"username":"TsuinoSora","name":null,"avatarUrl":"/uploads/image/77/06/7706643ba6d3ee1ec9d0070db0ad8a22bed8651fa8eb829cf44df4d20fa24b3b.avif"},"tags":[]},"posts":[{"id":18102,"postNumber":1,"raw":"从零开始，此前没有任何算法竞赛经验，没有系统刷过题","cooked":"

从零开始，此前没有任何算法竞赛经验，没有系统刷过题

\n","createdAt":"2023-11-27 14:55:38.654449","updatedAt":"2023-11-27 14:55:38.654449","replyToPostNumber":null,"replyCount":0,"likeCount":4,"wordCount":25,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":4,"users":[{"id":307,"username":"Fast","name":null},{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old"},{"id":1818,"username":"Trainer","name":"小栗帽的"},{"id":1835,"username":"Dusk","name":"夕大画家"}],"hasReacted":false}],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":31,"username":"TsuinoSora","name":null,"avatarUrl":"/uploads/image/77/06/7706643ba6d3ee1ec9d0070db0ad8a22bed8651fa8eb829cf44df4d20fa24b3b.avif","admin":false,"moderator":true,"signatureRaw":null,"signatureCooked":null}},{"id":18103,"postNumber":2,"raw":"加油！楼主要坚持啊，暑假一起刷（","cooked":"

加油！楼主要坚持啊，暑假一起刷（

\n","createdAt":"2023-11-27 14:57:09.815053","updatedAt":"2024-03-30 03:24:32.033277","replyToPostNumber":null,"replyCount":2,"likeCount":0,"wordCount":16,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old","avatarUrl":"/uploads/image/43/32/4332638c11248b8ff07033c11de0759a55205facfbec85e14458245a91991faf.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18104,"postNumber":3,"raw":"![image|690x312](/uploads/image/db/46/db46c400db9cf6124649dda8e9418d4b0b594302fc9808977dad46906dab7687.avif)\n基本没做过，启动！","cooked":"

$\"image\"$
\n基本没做过，启动！

\n","createdAt":"2023-11-27 14:59:18.736017","updatedAt":"2023-11-27 14:59:29.63322","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":10,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":31,"username":"TsuinoSora","name":null,"avatarUrl":"/uploads/image/77/06/7706643ba6d3ee1ec9d0070db0ad8a22bed8651fa8eb829cf44df4d20fa24b3b.avif","admin":false,"moderator":true,"signatureRaw":null,"signatureCooked":null}},{"id":18117,"postNumber":4,"raw":"![Screenshot 2023-11-27 at 23.58.12|690x324](/uploads/image/6d/64/6d6497b9d2ed95e0e977ac664cebfbb14647bb03ea479e5faaafc1918caef460.avif)\n\n完全没做过，启动！","cooked":"

$\"Screenshot$

完全没做过，启动！

\n","createdAt":"2023-11-27 15:58:38.485602","updatedAt":"2024-10-25 11:18:56.168581","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":13,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18118,"postNumber":5,"raw":"数据结构与算法，启动！","cooked":"

数据结构与算法，启动！

\n","createdAt":"2023-11-27 16:01:29.635515","updatedAt":"2024-10-25 11:18:56.390221","replyToPostNumber":2,"replyCount":0,"likeCount":0,"wordCount":11,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18119,"postNumber":6,"raw":"暑假？","cooked":"

暑假？

\n","createdAt":"2023-11-27 16:09:15.715921","updatedAt":"2024-03-17 13:07:38.744773","replyToPostNumber":2,"replyCount":0,"likeCount":0,"wordCount":3,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old","avatarUrl":"/uploads/image/43/32/4332638c11248b8ff07033c11de0759a55205facfbec85e14458245a91991faf.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18123,"postNumber":7,"raw":"今晚蒜了。因为刚刚突然在群里聊嗨了一直聊到现在。","cooked":"

今晚蒜了。因为刚刚突然在群里聊嗨了一直聊到现在。

\n","createdAt":"2023-11-27 17:21:10.290688","updatedAt":"2023-11-27 17:21:10.290688","replyToPostNumber":null,"replyCount":1,"likeCount":0,"wordCount":24,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":31,"username":"TsuinoSora","name":null,"avatarUrl":"/uploads/image/77/06/7706643ba6d3ee1ec9d0070db0ad8a22bed8651fa8eb829cf44df4d20fa24b3b.avif","admin":false,"moderator":true,"signatureRaw":null,"signatureCooked":null}},{"id":18130,"postNumber":8,"raw":"良好的开始🤣加油捏，寒假一起刷:rofl_kissing_heart:","cooked":"

良好的开始🤣加油捏，寒假一起刷:rofl_kissing_heart:

\n","createdAt":"2023-11-28 01:27:06.065203","updatedAt":"2023-11-28 01:27:22.3745","replyToPostNumber":7,"replyCount":0,"likeCount":0,"wordCount":16,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":1628,"username":"Lorange","name":"主治医师李大华","avatarUrl":"/uploads/image/f8/ec/f8ecbeb887c4a1311f4f0bf05928476c7b3f632d15bb2b24e782baf2ba6f0d71.avif","admin":false,"moderator":true,"signatureRaw":null,"signatureCooked":null}},{"id":18134,"postNumber":9,"raw":"时间挤不出来一点😭","cooked":"

时间挤不出来一点😭

\n","createdAt":"2023-11-28 02:40:32.756914","updatedAt":"2023-11-28 02:40:32.756914","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":9,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":1012,"username":"Ratled","name":"精神zjuer","avatarUrl":"/uploads/image/89/ef/89ef07eb555027991fb26d221d8c82a190263dadfbc37bf3168f21f00fe77884.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18140,"postNumber":10,"raw":"太吊了。一个 easy 也不会","cooked":"

太吊了。一个 easy 也不会

\n","createdAt":"2023-11-28 06:27:18.668057","updatedAt":"2023-11-28 06:27:18.668057","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":10,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":178,"username":"Hypocrisy","name":"rotartsinimdA","avatarUrl":"/uploads/image/ce/f3/cef3773e378e161524cc7523c8a63dff0698d22802b0c1ab669894d395ee36a3.avif","admin":false,"moderator":true,"signatureRaw":null,"signatureCooked":null}},{"id":18208,"postNumber":11,"raw":"做了两道有意思的题\n[Linked List Cycle - LeetCode](https://leetcode.com/problems/linked-list-cycle/description/)\n[Linked List Cycle II - LeetCode](https://leetcode.com/problems/linked-list-cycle-ii/)","cooked":"

做了两道有意思的题
\nLinked List Cycle - LeetCode
\nLinked List Cycle II - LeetCode

\n","createdAt":"2023-11-29 02:17:10.302598","updatedAt":"2023-11-29 02:17:10.302598","replyToPostNumber":null,"replyCount":1,"likeCount":0,"wordCount":20,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":31,"username":"TsuinoSora","name":null,"avatarUrl":"/uploads/image/77/06/7706643ba6d3ee1ec9d0070db0ad8a22bed8651fa8eb829cf44df4d20fa24b3b.avif","admin":false,"moderator":true,"signatureRaw":null,"signatureCooked":null}},{"id":18216,"postNumber":12,"raw":"做了。\n\n[141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)\n\n```java\npublic class Solution {\n public boolean hasCycle(ListNode head) {\n ListNode fast = head, slow = head;\n while (fast != null && fast.next != null && slow != null) {\n fast = fast.next.next;\n slow = slow.next;\n if (fast == slow) {\n return true;\n }\n }\n return false;\n }\n}\n```\n\n[142. Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)\n\n这个有点 tricky。要求空间复杂度 $O(1)$ ，又不让 modify linked list。于是看了下讨论区，发现真的是 tricky。\n\n```java\npublic class Solution {\n public ListNode detectCycle(ListNode head) {\n ListNode fast = head, slow = head;\n while (fast != null && fast.next != null && slow != null) {\n fast = fast.next.next;\n slow = slow.next;\n if (fast == slow) {\n while (slow != head) {\n head = head.next;\n slow = slow.next;\n }\n return head;\n }\n }\n return null;\n }\n}\n```","cooked":"

做了。

141. Linked List Cycle

public class Solution {\n  public boolean hasCycle(ListNode head) {\n    ListNode fast = head, slow = head;\n    while (fast != null && fast.next != null && slow != null) {\n      fast = fast.next.next;\n      slow = slow.next;\n      if (fast == slow) {\n        return true;\n      }\n    }\n    return false;\n  }\n}\n

142. Linked List Cycle II

这个有点 tricky。要求空间复杂度 $O(1)$ ，又不让 modify linked list。于是看了下讨论区，发现真的是 tricky。

public class Solution {\n  public ListNode detectCycle(ListNode head) {\n    ListNode fast = head, slow = head;\n    while (fast != null && fast.next != null && slow != null) {\n      fast = fast.next.next;\n      slow = slow.next;\n      if (fast == slow) {\n        while (slow != head) {\n          head = head.next;\n          slow = slow.next;\n        }\n        return head;\n      }\n    }\n    return null;\n  }\n}\n

\n","createdAt":"2023-11-29 07:11:06.839601","updatedAt":"2024-10-25 11:18:56.745555","replyToPostNumber":11,"replyCount":1,"likeCount":2,"wordCount":159,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":2,"users":[{"id":31,"username":"TsuinoSora","name":null},{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old"}],"hasReacted":false}],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18218,"postNumber":13,"raw":"[877. Stone Game](https://leetcode.com/problems/stone-game/)\n\n有点好笑，这个难度为 medium 的题目，答案就只有一行：\n\n```java\nclass Solution {\n public boolean stoneGame(int[] piles) {\n return true;\n }\n}\n```\n\n主要看证明：因为 piles.length 为偶数，所以 Alice 每次都可以选择是拿奇数列还是偶数列，而 Bob 没有选择权利。如果所有奇数 pile 的值之和大于偶数的，那 Alice 每次都拿奇数 index 的，那么 Bob 每次都只能拿偶数 index 的，所以 Alice 永远会赢。and vice versa.","cooked":"

877. Stone Game

有点好笑，这个难度为 medium 的题目，答案就只有一行：

class Solution {\n  public boolean stoneGame(int[] piles) {\n    return true;\n  }\n}\n

主要看证明：因为 piles.length 为偶数，所以 Alice 每次都可以选择是拿奇数列还是偶数列，而 Bob 没有选择权利。如果所有奇数 pile 的值之和大于偶数的，那 Alice 每次都拿奇数 index 的，那么 Bob 每次都只能拿偶数 index 的，所以 Alice 永远会赢。and vice versa.

\n","createdAt":"2023-11-29 07:45:14.252818","updatedAt":"2024-10-25 11:18:56.992689","replyToPostNumber":null,"replyCount":0,"likeCount":1,"wordCount":135,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":1,"users":[{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old"}],"hasReacted":false}],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18235,"postNumber":14,"raw":"草，我 142 第一次做的太直接了，但是还好能 ac（\n\n```java\npublic class Solution {\n public ListNode detectCycle(ListNode head) {\n ListNode detected = head;// 要被判断是否是开始循环的结点\n while (detected != null) { // 下同 141 题判断是否有循环\n ListNode slow = detected;\n ListNode fast = detected;\n while (fast != null && fast.next != null ) {\n slow = slow.next;\n fast = fast.next.next;\n // 同时判断是否回到要被判断的结点\n if (slow == detected || fast == detected) {\n return detected;\n }\n if (slow == fast) {\n break;\n }\n }\n detected = detected.next;\n }\n return null;\n }\n}\n```\n\n然后喜提速度最慢一档。后看了讨论区的方法，服了","cooked":"

草，我 142 第一次做的太直接了，但是还好能 ac（

public class Solution {\n    public ListNode detectCycle(ListNode head) {\n        ListNode detected = head;// 要被判断是否是开始循环的结点\n        while (detected != null) {    // 下同 141 题 判断是否有循环\n            ListNode slow = detected;\n            ListNode fast = detected;\n            while (fast != null && fast.next != null ) {\n                slow = slow.next;\n                fast = fast.next.next;\n                // 同时判断是否回到要被判断的结点\n                if (slow == detected || fast == detected) {\n                    return detected;\n                }\n                if (slow == fast) {\n                    break;\n                }\n            }\n            detected = detected.next;\n        }\n        return null;\n    }\n}\n

然后喜提速度最慢一档。后看了讨论区的方法，服了

\n","createdAt":"2023-11-29 15:58:42.386073","updatedAt":"2023-11-29 15:58:42.386073","replyToPostNumber":12,"replyCount":1,"likeCount":0,"wordCount":157,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":31,"username":"TsuinoSora","name":null,"avatarUrl":"/uploads/image/77/06/7706643ba6d3ee1ec9d0070db0ad8a22bed8651fa8eb829cf44df4d20fa24b3b.avif","admin":false,"moderator":true,"signatureRaw":null,"signatureCooked":null}},{"id":18236,"postNumber":15,"raw":"trade off of time and space. 为了空间有点太舍弃时间了，还不如做标记位（\n\n感觉你这个 worst case time complexity 有 $O(N^2)$","cooked":"

trade off of time and space. 为了空间有点太舍弃时间了，还不如做标记位（

感觉你这个 worst case time complexity 有 $O(N^2)$

\n","createdAt":"2023-11-29 16:21:13.586238","updatedAt":"2024-10-25 11:18:57.318532","replyToPostNumber":14,"replyCount":0,"likeCount":1,"wordCount":38,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":1,"users":[{"id":31,"username":"TsuinoSora","name":null}],"hasReacted":false}],"wiki":false,"version":2,"publicVersion":2,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18278,"postNumber":16,"raw":"我每日一题呢 😉","cooked":"

我每日一题呢 😉

\n","createdAt":"2023-12-01 06:01:06.55124","updatedAt":"2024-10-25 11:18:57.468486","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":7,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18638,"postNumber":17,"raw":"[12. Integer to Roman](https://leetcode.com/problems/integer-to-roman/)\n\n怎么又是无脑题目\n\n```java\nclass Solution {\n\n public String intToRoman(int num) {\n StringBuilder roman = new StringBuilder();\n \n if (num / 1000 > 0) {\n roman.append(\"M\".repeat(num / 1000));\n num %= 1000;\n }\n if (num >= 900) {\n roman.append(\"CM\");\n num -= 900;\n }\n if (num >= 500) {\n roman.append(\"D\");\n num -= 500;\n }\n if (num >= 400) {\n roman.append(\"CD\");\n num -= 400;\n }\n if (num / 100 > 0) {\n roman.append(\"C\".repeat(num / 100));\n num %= 100;\n }\n if (num >= 90) {\n roman.append(\"XC\");\n num -= 90;\n }\n if (num >= 50) {\n roman.append(\"L\");\n num -= 50;\n }\n if (num >= 40) {\n roman.append(\"XL\");\n num -= 40;\n }\n if (num / 10 > 0) {\n roman.append(\"X\".repeat(num / 10));\n num %= 10;\n }\n if (num >= 9) {\n roman.append(\"IX\");\n num -= 9;\n }\n if (num >= 5) {\n roman.append(\"V\");\n num -= 5;\n }\n if (num >= 4) {\n roman.append(\"IV\");\n num -= 4;\n }\n if (num > 0) {\n roman.append(\"I\".repeat(num));\n }\n return roman.toString();\n }\n}\n\n```\n\n当然写法可以优化","cooked":"

12. Integer to Roman

怎么又是无脑题目

class Solution {\n\n    public String intToRoman(int num) {\n        StringBuilder roman = new StringBuilder();\n        \n        if (num / 1000 > 0) {\n            roman.append(\"M\".repeat(num / 1000));\n            num %= 1000;\n        }\n        if (num >= 900) {\n            roman.append(\"CM\");\n            num -= 900;\n        }\n        if (num >= 500) {\n            roman.append(\"D\");\n            num -= 500;\n        }\n        if (num >= 400) {\n            roman.append(\"CD\");\n            num -= 400;\n        }\n        if (num / 100 > 0) {\n            roman.append(\"C\".repeat(num / 100));\n            num %= 100;\n        }\n        if (num >= 90) {\n            roman.append(\"XC\");\n            num -= 90;\n        }\n        if (num >= 50) {\n            roman.append(\"L\");\n            num -= 50;\n        }\n        if (num >= 40) {\n            roman.append(\"XL\");\n            num -= 40;\n        }\n        if (num / 10 > 0) {\n            roman.append(\"X\".repeat(num / 10));\n            num %= 10;\n        }\n        if (num >= 9) {\n            roman.append(\"IX\");\n            num -= 9;\n        }\n        if (num >= 5) {\n            roman.append(\"V\");\n            num -= 5;\n        }\n        if (num >= 4) {\n            roman.append(\"IV\");\n            num -= 4;\n        }\n        if (num > 0) {\n            roman.append(\"I\".repeat(num));\n        }\n        return roman.toString();\n    }\n}\n\n

当然写法可以优化

\n","createdAt":"2023-12-05 10:00:41.520862","updatedAt":"2024-10-25 11:18:57.604369","replyToPostNumber":null,"replyCount":0,"likeCount":1,"wordCount":178,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":1,"users":[{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old"}],"hasReacted":false}],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18641,"postNumber":18,"raw":"debug 还要花钱，烂完了。","cooked":"

debug 还要花钱，烂完了。

\n","createdAt":"2023-12-05 10:23:34.225447","updatedAt":"2024-10-25 11:18:58.021024","replyToPostNumber":null,"replyCount":0,"likeCount":0,"wordCount":10,"liked":false,"bookmarked":false,"polls":[],"reactions":[],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18668,"postNumber":19,"raw":"看 OI wiki 复习了一下 hash table，原来算法竞赛中常用的冲突处理方法是 separate chaining","cooked":"

看 OI wiki 复习了一下 hash table，原来算法竞赛中常用的冲突处理方法是 separate chaining

\n","createdAt":"2023-12-05 14:51:46.235585","updatedAt":"2024-10-25 11:18:58.490431","replyToPostNumber":null,"replyCount":0,"likeCount":1,"wordCount":29,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":1,"users":[{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old"}],"hasReacted":false}],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}},{"id":18673,"postNumber":20,"raw":"[1. Two Sum](https://leetcode.com/problems/two-sum/)\n\n我太成功了，真的。彻底成功。\n\n```java\nclass Solution {\n\n public int[] twoSum(int[] nums, int target) {\n int n = nums.length;\n Map m = new HashMap();\n\n for (int i = 0; i < n; i++) {\n if (m.containsKey(target - nums[i])) return new int[] {i, m.get(target - nums[i])};\n m.put(nums[i], i);\n }\n return null;\n }\n}\n```","cooked":"

1. Two Sum

我太成功了，真的。彻底成功。

class Solution {\n\n    public int[] twoSum(int[] nums, int target) {\n        int n = nums.length;\n        Map<Integer, Integer> m = new HashMap<Integer, Integer>();\n\n        for (int i = 0; i < n; i++) {\n            if (m.containsKey(target - nums[i])) return new int[] {i, m.get(target - nums[i])};\n            m.put(nums[i], i);\n        }\n        return null;\n    }\n}\n

\n","createdAt":"2023-12-05 15:54:55.357839","updatedAt":"2024-10-25 11:18:59.178898","replyToPostNumber":null,"replyCount":0,"likeCount":1,"wordCount":68,"liked":false,"bookmarked":false,"polls":[],"reactions":[{"reaction":"❤️","count":1,"users":[{"id":1047,"username":"anonymous_coward_old","name":"Anonymous Coward Old"}],"hasReacted":false}],"wiki":false,"version":1,"publicVersion":1,"deletedAt":null,"isAnonymous":false,"user":{"id":6205,"username":"uika_winwing","name":null,"avatarUrl":"/uploads/image/76/3b/763b1e5ad8a424c4450bb26cea5ae532e7b1cd9da926ac5d99215d7123bf6002.avif","admin":false,"moderator":false,"signatureRaw":null,"signatureCooked":null}}],"hasMore":true,"lastReadPostNumber":9,"hasUrlPostNumber":true}