随笔分类 - 【Algorithm】
摘要:https://leetcode.com/tag/dynamic-programming/
阅读全文
摘要:https://leetcode.com/tag/binary-search-tree/
阅读全文
摘要:https://leetcode.com/tag/math/
阅读全文
摘要:https://leetcode.com/tag/binary-search/
阅读全文
摘要:https://leetcode.com/tag/heap/
阅读全文
摘要:【334】Increasing Triplet Subsequence (2019年2月14日,google tag)(greedy) 给了一个数组 nums,判断是否有三个数字组成子序列,使得子序列递增。题目要求time complexity: O(N),space complexity: O(1
阅读全文
摘要:https://leetcode.com/tag/bit-manipulation/
阅读全文
摘要:https://leetcode.com/tag/trie/
阅读全文
摘要:1、mst 没有堆优化的prim算法 原题链接: http://hihocoder.com/problemset/problem/1097 1 //原题链接: http://hihocoder.com/problemset/problem/1097 2 3 #include <iostream> 4
阅读全文
摘要:https://leetcode.com/tag/string/
阅读全文
摘要:https://leetcode.com/tag/backtracking/
阅读全文
摘要:https://leetcode.com/tag/divide-and-conquer/
阅读全文
摘要:线段树:https://leetcode.com/tag/segment-tree/ |||||树状数组:https://leetcode.com/tag/binary-indexed-tree/
阅读全文
摘要:https://leetcode.com/tag/hash-table/
阅读全文
摘要:https://leetcode.com/tag/design/
阅读全文
摘要:https://leetcode.com/tag/minimax/
阅读全文
摘要:https://leetcode.com/tag/random/
阅读全文
摘要:必须用dfs的才用dfs求解,显而易见可以动态规划的都用动态规划求解。
https://leetcode.com/tag/depth-first-search/
阅读全文
摘要:https://leetcode.com/tag/stack/
阅读全文
浙公网安备 33010602011771号