Given n non-negative integers a1, a2,
..., an, where each represents a point at coordinate (i, ai). n vertical
lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
0). Fin...
分类：
其他好文 时间：
2015-01-17 23:33:30
阅读次数：
190
最近在做一个项目，有一个需求是在ScrollView中内嵌一个GridView。 刚开始，我是以为能直接内嵌在里面: 1 5 15 16 > 2, MeasureSpec.AT_MOST);15 super.onMeasure(widthMe...
分类：
移动开发 时间：
2015-01-17 23:28:22
阅读次数：
343
Queuing
Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
Queues and Priority Queues are data structures which are known to most comp...
分类：
其他好文 时间：
2015-01-17 16:36:07
阅读次数：
201
题目：Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is...
分类：
编程语言 时间：
2015-01-16 23:37:11
阅读次数：
215
一：HMM解码问题
（1）给定一个观察序列O=O1O2...OT,和模型μ=（A,B,π），如何快速有效地选择在一定意义下“最优”的状态序列Q=q1q2...qT，使该状态最好地解释观察序列。
（2）最可能的隐藏状态序列(Finding most probable sequence of hidden states)；对于一个特殊的隐马尔科夫模型(HMM)及一个相应的观察序列，我们常常希望能找...
分类：
其他好文 时间：
2015-01-16 13:11:21
阅读次数：
232
# -*- coding: utf8 -*-'''https://oj.leetcode.com/problems/container-with-most-water/Given n non-negative integers a1, a2, ..., an, where each represen...
分类：
编程语言 时间：
2015-01-15 20:18:43
阅读次数：
987
Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ...
分类：
其他好文 时间：
2015-01-15 18:07:39
阅读次数：
131
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类：
其他好文 时间：
2015-01-15 12:38:33
阅读次数：
158
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),...
分类：
其他好文 时间：
2015-01-15 09:30:17
阅读次数：
172
