bingshen的专栏

leetcode 1223. 掷骰子模拟，动态规划算法

LeetCode 834.树中距离之和 Sum of distance in tree给定一个无向、连通的树。树中有 N 个标记为 0...N-1 的节点以及 N-1 条边 。第 i 条边连接节点 edges[i][0] 和 edges[i][1] 。返回一个表示节点 i 与其他所有节点距离之和的列表 ans。示例 1:输入: N = 6, edges = [[0,1],[0,2...

给定一个整数数组 prices，其中第 i 个元素代表了第 i 天的股票价格 ；非负整数 fee 代表了交易股票的手续费用。你可以无限次地完成交易，但是你每次交易都需要付手续费。如果你已经购买了一个股票，在卖出它之前你就不能再继续购买股票了。返回获得利润的最大值。示例 1:输入: prices = [1, 3, 2, 8, 4, 9], fee = 2输出: 8解释: 能够达...

描述Given a positive integer n and you can do operations as follow:1.If n is even, replace n with n/2.2.If n is odd, you can replace n with either n + 1 or n - 1.What is the minimum number of rep...

B. Shaass and Bookshelftime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputShaass has n books. He wants to mak

题目链接：http://poj.org/problem?id=3186题意：给定n个数每次可以从头或者尾取出数据于是按取出来得顺序，就可以排成一个数列，假设这个数列为a1,a2,a3,a4.......an现在我们假设按照取出来的顺序有一个权值w=a1*1+a2*2+a3*3+....an*n现在需要编程求出，如何控制取数的顺序，让w的值最大 思路：首先我以

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8342    Accepte

小兔的棋盘Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2443    Accepted Submission

BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1659 Accepted: 831DescriptionWe give

Human Gene FunctionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10904 Accepted: 6015<br />DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters,

C.   Visiting CowsTime Limit: 1.0 Seconds   Memory Limit: 65536K<br />Total Runs: 61   Accepted Runs: 21    Multiple test files<br /><br /><br />Description<br />After many weeks of hard work, Bessie is finally getting a vacation! Being the most social cow