There are n coins with different value in a line. Two players take turns to take one or two coins from left side until there are no more coins left. ...

There are n coins with different value in a line. Two players take turns to take one or two coins from left side until there are no more ...

题目 硬币排成线 II 有 n 个不同价值的硬币排成一条线。两个参赛者轮流从左边依次拿走 1 或 2 个硬币，直到没有硬币为止。计算两个人分别拿到的硬币总价值，价值高的人获胜。 ...

There are n coins in a line. Two players take turns to take one or two coins from right side until there are no more coins left. The player ...

利用bitwise XOR的特点，n个数（0或1），如果1的个数为奇数，则n个数bitwise XOR结果为1，否则为0 先将所有的数异或，得到的将是x和y以后之后的值n。 找到这个数 ...

Given an array of integers and a number k, find k non-overlapping subarrays which have the largest s ...

买卖股票的最佳时机 III 假设你有一个数组，它的第i个元素是一支给定的股票在第i天的价格。设计一个算法来找到最大的利润。你最多可以完成两笔交易。 样例 给出一个样例数组 [4,4,6,1,1,4,2,5], 返回 ...

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n, find the total ...