摘要：
Given a time represented in the format "HH:MM", form the next closest time by reusing the current digits. There is no limit on how many times a digit 阅读全文
阅读排行榜
[LeetCode] 212. Word Search II_Hard tag: Trie, DFS
2021-06-29 20:06 by Johnson_强生仔仔, 43 阅读, 收藏,
摘要：
Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentia 阅读全文
[LeetCode] 208. Implement Trie (Prefix Tree)_Medium tag: Trie
2021-06-29 05:20 by Johnson_强生仔仔, 41 阅读, 收藏,
摘要：
A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are va 阅读全文
[LeetCode] 833. Find And Replace in String_Medium tag: array
2021-08-12 01:47 by Johnson_强生仔仔, 40 阅读, 收藏,
摘要：
Y ou are given a 0-indexed string s that you must perform k replacement operations on. The replacement operations are given as three 0-indexed paralle 阅读全文
[LeetCode] 957. Prison Cells After N Days_Medium Tag: Array
2021-07-29 10:54 by Johnson_强生仔仔, 40 阅读, 收藏,
摘要：
There are 8 prison cells in a row and each cell is either occupied or vacant. Each day, whether the cell is occupied or vacant changes according to th 阅读全文
浙公网安备 33010602011771号