摘要: class Solution { #define maxn 10010 vector<int> edges[maxn]; public: vector<int> eventualSafeNodes(vector<vector<int>>& graph) { int i, j; int n = gra 阅读全文
posted @ 2022-05-30 12:30 越菜越自信 阅读(20) 评论(0) 推荐(0)
摘要: ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220527234837944-1718030441.png) ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220527234910631-2043297981.png) ![](https:// 阅读全文
posted @ 2022-05-28 00:00 越菜越自信 阅读(18) 评论(0) 推荐(0)
摘要: ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220527231926517-893493373.png) ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220527231953171-230916926.png) ![](https://im 阅读全文
posted @ 2022-05-27 23:45 越菜越自信 阅读(19) 评论(0) 推荐(0)
摘要: const int TRIE_WORD_COUNT = 400000; const int TRIE_WORD_LENGTH = 10; const int TRIE_NODE_CACHES = TRIE_WORD_COUNT * TRIE_WORD_LENGTH; // 字典 树类 class T 阅读全文
posted @ 2022-05-24 23:10 越菜越自信 阅读(23) 评论(0) 推荐(0)
摘要: ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220523215032639-620304885.png) ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220523215056101-854313360.png) ![](https://im 阅读全文
posted @ 2022-05-23 22:05 越菜越自信 阅读(18) 评论(0) 推荐(0)
摘要: ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220521192125645-50620354.png) ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220521192145747-1146332673.png) ![](https://im 阅读全文
posted @ 2022-05-21 19:42 越菜越自信 阅读(27) 评论(0) 推荐(0)
摘要: ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220518093804283-773052653.png) ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220518093850825-1304462674.png) ![](https://i 阅读全文
posted @ 2022-05-18 09:52 越菜越自信 阅读(23) 评论(0) 推荐(0)
摘要: ![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220518092205520-2145712889.png)![](https://img2022.cnblogs.com/blog/2540508/202205/2540508-20220518092223372-1926812875.png)![](https://im... 阅读全文
posted @ 2022-05-18 09:36 越菜越自信 阅读(19) 评论(0) 推荐(0)
摘要: /**************************** 顺序表 实现双端队列 ****************************/ #define DataType int #define maxn 100005 struct Queue { DataType data[maxn<<1]; 阅读全文
posted @ 2022-05-17 07:05 越菜越自信 阅读(42) 评论(0) 推荐(0)
摘要: /**************************** 链表 实现队列 ****************************/ typedef int DataType; struct QueueNode; struct QueueNode { DataType data; struct Q 阅读全文
posted @ 2022-05-17 06:43 越菜越自信 阅读(21) 评论(0) 推荐(0)