2025年3月31日

摘要： 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 阅读全文

posted @ 2025-03-31 22:32 ZhangZhihuiAAA 阅读(12) 评论(0) 推荐(0)

LeetCode - Implement Trie (Prefix Tree)

摘要： 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 阅读全文

posted @ 2025-03-31 21:36 ZhangZhihuiAAA 阅读(20) 评论(0) 推荐(0)

LeetCode - Design Add and Search Words Data Structure

摘要： Design a data structure that supports adding new words and finding if a string matches any previously added string. Implement the WordDictionary class 阅读全文

posted @ 2025-03-31 19:29 ZhangZhihuiAAA 阅读(12) 评论(0) 推荐(0)

LeetCode - Word Ladder

摘要： A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk su 阅读全文

posted @ 2025-03-31 16:33 ZhangZhihuiAAA 阅读(17) 评论(0) 推荐(0)

LeetCode - Minimum Genetic Mutation

摘要： A gene string can be represented by an 8-character long string, with choices from 'A', 'C', 'G', and 'T'. Suppose we need to investigate a mutation fr 阅读全文

posted @ 2025-03-31 11:39 ZhangZhihuiAAA 阅读(9) 评论(0) 推荐(0)


博客园 © 2004-2025 浙公网安备 33010602011771号浙ICP备2021040463号-3

导航

2025年3月31日