![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C
文章平均质量分 54
GuoWwww
这个作者很懒,什么都没留下…
展开
-
2017002-分治算法
分治法的设计思想是:将一个难以直接解决的大问题,分割成一些规模较小的相同问题,以便各个击破,分而治之。 分治策略是:对于一个规模为n的问题,若该问题可以容易地解决(比如说规模n较小)则直接解决,否则将其分解为k个规模较小的子问题,这些子问题互相独立且与原问题形式相同,递归地解这些子问题,然后将各子问题的解合并得到原问题的解。这种算法设计策略叫做分治法。 如果原问题可分割成k个子原创 2017-03-05 20:43:52 · 228 阅读 · 0 评论 -
2017003
Given a collection of distinct numbers, return all possible permutations.原创 2017-03-13 14:29:01 · 180 阅读 · 0 评论 -
2017011
Burst Balloons 打气球游戏 Given n balloons, indexed from 0 to n-1 . Each balloon is painted with a number on it represented by array nums . You are asked to burst all the balloons. If the you原创 2017-05-01 16:35:13 · 233 阅读 · 0 评论 -
2017013
Remove Duplicate Letters 移除重复字母 Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is原创 2017-05-15 10:25:23 · 187 阅读 · 0 评论 -
2017010
[LeetCode] Largest BST Subtree 最大的二分搜索子树 Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. No原创 2017-04-24 17:10:22 · 152 阅读 · 0 评论 -
2017012
[LeetCode] Flip Game 翻转游戏之二 You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and - , you and your friend take turns to flip原创 2017-05-08 19:45:22 · 153 阅读 · 0 评论 -
2017015
[LeetCode] Palindrome Pairs Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j]原创 2017-06-06 11:05:41 · 150 阅读 · 0 评论 -
2017014
Palindrome Pairs 回文对 Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] is a palindrom原创 2017-05-22 10:13:06 · 133 阅读 · 0 评论