Memory Search
文章平均质量分 52
CS番茄
这个作者很懒,什么都没留下…
展开
-
LeetCode 87. Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \ gr ...原创 2018-08-04 00:03:02 · 178 阅读 · 0 评论 -
LintCode 394. Coins in a Line
DescriptionThere 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 who take the last coin wins.Could you please ...原创 2018-08-02 16:50:40 · 294 阅读 · 0 评论 -
LintCode 395. Coins in a Line II
395. Coins in a Line IIThere 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. The player who take the co...原创 2018-08-02 19:32:08 · 277 阅读 · 0 评论 -
LeetCode 877. Stone Game
Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].The objective of the game is to en...原创 2018-08-02 20:19:57 · 574 阅读 · 0 评论 -
LeetCode 312. 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 burst balloon i you will get nums[le...原创 2018-08-09 00:05:48 · 122 阅读 · 0 评论