- 博客(2)
- 收藏
- 关注
RSS订阅原创 leetcode dynamic programming
300. Longest Increasing SubsequenceQuestionGiven an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasi
2015-12-29 16:13:37
448
原创 leetcode 319. Bulb Switcher
QuestionThere are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turni
2015-12-28 09:56:44
462
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人