Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of th ...
分类：
其他好文 时间：
2016-12-05 13:43:24
阅读次数：
156
The best strategy to play the game is to minimize the maximum loss you could possibly face. Definition of dp[i][j]: minimum number of money to guarant ...
分类：
其他好文 时间：
2016-11-28 09:34:33
阅读次数：
195
http://www.scarydba.com/2011/06/15/rebind-and-rewind-in-execution-plans/ Ever looked at an execution plan? If you answered no, you can’t possibly have ...
Problem Description Alex has invented a new game for fun. There are n integers at a board and he performs the following moves repeatedly:1. He chooses ...
分类：
其他好文 时间：
2016-11-13 19:30:51
阅读次数：
332
为了加深对缓存算法的理解，特转此篇，又由于本文内容过多，故不做翻译，原文地址Working Set页面置换算法 In the purest form of paging, processes are started up with none of their pages in memory. As ...
分类：
编程语言 时间：
2016-11-13 19:28:25
阅读次数：
248
NavigationController and the View Controllers are designed in such a way that only one view controller may show at a time. When a new view controller ...
分类：
其他好文 时间：
2016-10-28 03:20:33
阅读次数：
296
We have a lot of ways to solve the maximum subsequence sum problem, but different ways take different time. 1、Brute-force algorithm 2、a little imporve ...
分类：
其他好文 时间：
2016-10-24 23:15:06
阅读次数：
295
NHibernate常见问题及解决方法 曾经学过NHibernate的，但是自从工作到现在快一年了却从未用到过，近来要巩固一下却发现忘记了许多，一个“in expected: <end-of-text> (possibly an invalid or unmapped class name was ...
分类：
Web程序 时间：
2016-10-16 23:57:07
阅读次数：
613
BCCH，CCCH，DCCH、DTCH 都映射到 DL-SCH 再映射到 PDSCH，UE是如何区分这三者呢？我知道用SI-RNTI加扰的PDCCH对应BCCH，那如何区DCCH，DTCH，它们都是用C-RNTI加扰的吧 possibly by the LCID field of MAC heade ...
分类：
其他好文 时间：
2016-10-05 20:01:06
阅读次数：
499
/tmp is meant as fast (possibly small) storage with a short time to live (TTL). Many systems clean /tmp very fast - on some systems it is even mounted ...
分类：
其他好文 时间：
2016-09-19 01:07:37
阅读次数：
177
