- 博客(2)
- 收藏
- 关注
RSS订阅原创 [leetcode] 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 wil
2016-02-25 00:00:17
852
原创 [leetcode] Divide and Conquer
下面简单聊聊leetcode中的两道类似的DC的题目。之所以来写博客，是因为它们的思路确实与以往遇到的简单的DC有所不同。1. Count of range sumGiven an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Ra
2016-02-24 23:55:46
1528
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人