随笔分类 -  【Algorithm】

摘要:https://leetcode.com/tag/dynamic-programming/ 阅读全文
posted @ 2019-05-20 17:00 zhangwanying 阅读(431) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/binary-search-tree/ 阅读全文
posted @ 2019-04-20 17:30 zhangwanying 阅读(403) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/math/ 阅读全文
posted @ 2019-04-19 14:24 zhangwanying 阅读(895) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/binary-search/ 阅读全文
posted @ 2019-04-15 12:27 zhangwanying 阅读(387) 评论(0) 推荐(0)
只有注册用户登录后才能阅读该文。
posted @ 2019-04-09 20:04 zhangwanying 阅读(159) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/heap/ 阅读全文
posted @ 2019-04-06 18:10 zhangwanying 阅读(2345) 评论(0) 推荐(0)
摘要:【334】Increasing Triplet Subsequence (2019年2月14日,google tag)(greedy) 给了一个数组 nums,判断是否有三个数字组成子序列,使得子序列递增。题目要求time complexity: O(N),space complexity: O(1 阅读全文
posted @ 2019-03-28 12:27 zhangwanying 阅读(294) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/bit-manipulation/ 阅读全文
posted @ 2019-03-26 19:26 zhangwanying 阅读(563) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/trie/ 阅读全文
posted @ 2019-03-26 18:29 zhangwanying 阅读(1686) 评论(0) 推荐(0)
摘要:1、mst 没有堆优化的prim算法 原题链接: http://hihocoder.com/problemset/problem/1097 1 //原题链接: http://hihocoder.com/problemset/problem/1097 2 3 #include <iostream> 4 阅读全文
posted @ 2019-03-20 20:55 zhangwanying 阅读(217) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/string/ 阅读全文
posted @ 2019-03-18 13:31 zhangwanying 阅读(1129) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/backtracking/ 阅读全文
posted @ 2019-03-18 12:51 zhangwanying 阅读(874) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/divide-and-conquer/ 阅读全文
posted @ 2019-03-16 12:24 zhangwanying 阅读(2456) 评论(0) 推荐(0)
摘要:线段树:https://leetcode.com/tag/segment-tree/ |||||树状数组:https://leetcode.com/tag/binary-indexed-tree/ 阅读全文
posted @ 2019-03-15 13:19 zhangwanying 阅读(5093) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/hash-table/ 阅读全文
posted @ 2019-03-13 20:17 zhangwanying 阅读(917) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/design/ 阅读全文
posted @ 2019-03-13 15:09 zhangwanying 阅读(3534) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/minimax/ 阅读全文
posted @ 2019-03-12 22:05 zhangwanying 阅读(1308) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/random/ 阅读全文
posted @ 2019-03-12 14:52 zhangwanying 阅读(2774) 评论(0) 推荐(0)
摘要:必须用dfs的才用dfs求解,显而易见可以动态规划的都用动态规划求解。 https://leetcode.com/tag/depth-first-search/ 阅读全文
posted @ 2019-03-12 12:45 zhangwanying 阅读(1174) 评论(0) 推荐(0)
摘要:https://leetcode.com/tag/stack/ 阅读全文
posted @ 2019-03-11 21:49 zhangwanying 阅读(2714) 评论(0) 推荐(0)