算法
文章平均质量分 63
qingyin_1991
这个作者很懒,什么都没留下…
展开
-
leetcode 337:House Robber III
leetcode 337:House Robber III。leetcode新题,递归的动态规划原创 2016-03-16 17:11:00 · 654 阅读 · 0 评论 -
leetcode 122. Best Time to Buy and Sell Stock II 股票买卖最佳时间(二)
题目:Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i原创 2016-03-13 17:49:39 · 603 阅读 · 0 评论 -
leetcode 121.Best Time to Buy and Sell Stock 股票买卖最佳时间
题目:Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the原创 2016-03-13 17:32:08 · 1276 阅读 · 0 评论 -
leetcode 338 Counting Bits【leetcode新题】 数11,C++
leetcode 338 Counting Bits【leetcode新题】 数11,C++原创 2016-03-26 17:17:14 · 483 阅读 · 0 评论 -
leetcode 338:Counting Bits 数1,C++
题目:刚刚写了一篇有分析的,然而。。。。上传失败,我的小心灵很受伤,决定直接发代码.....有空再写完整版的分析.....简单来说,就是 一个数X的1的个数(countBit(X)),满足 countBit(X)=countBit(2^N)+countBit(X-2^N),用迭代,复杂度O(n)class Solution {public: vector countB原创 2016-03-26 19:36:36 · 281 阅读 · 0 评论 -
leetcode 343.Integer Break 整数分割(c++)
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, ret原创 2016-04-28 17:02:19 · 613 阅读 · 0 评论 -
leetcode 383. Ransom Note 勒索信
题目大意:勒索信(嗯,你没看错,勒索信,有没有吓哭)给一串任意的勒索信字符串和另一串字符串包含从杂志上剪下来的字母,要求你写一个函数来返回是否勒索信是否由该杂志中字母组成,不是的话返回失败。每一个杂志中的字母在你的勒索信中只能用一次。注:你可以假设字符串都只包含小写字母。背景介绍(作者瞎说的):大概因为美国绑匪勒索信都是从杂志上剪字母下来拼接而成(手写勒索信的话,可能被认出原创 2016-08-15 20:17:18 · 753 阅读 · 0 评论 -
leetcode 300.Longest Increasing Subsequence(最长递增子序列) O(nlogn)算法
leetcode 300.Longest Increasing Subsequence(最长递增子序列) ,网上多是动态规划,复杂度为O(n^2)算法;本文设计一个O(nlogn)算法,即维护最小的最长子序列原创 2016-09-09 16:09:42 · 609 阅读 · 0 评论