Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array....
分类：
其他好文 时间：
2014-12-08 00:54:38
阅读次数：
172
Problem Description
Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW.
If...
分类：
编程语言 时间：
2014-12-07 17:52:29
阅读次数：
262
一、准备1、准备服务器建立有2个节点的MySQLCLuster体系，使用6台服务器建立Haproxy+mysqlcluster(MySQL集群)体系节点配置说明节点对应的IP和端口Haproxy负载均衡(1个)centos6.31.1.1.11管理节点(1个)centos6.31.1.1.30SQL节点(2个)centos6.31.1.1.211.1.1.22数据节点(2个)cent..
分类：
数据库 时间：
2014-12-07 06:43:56
阅读次数：
356
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font ...
分类：
其他好文 时间：
2014-12-06 21:31:41
阅读次数：
168
Scramble StringGiven a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible...
分类：
其他好文 时间：
2014-12-06 12:44:32
阅读次数：
187
jboss 集群搭建，我曾尝试用jboss7.1版本的做集群，没有成功，后来就用jboss5.1的做了，下面是我做的一些主要的流程和需要修改的地方，供大家参考。有问题，请留言吧。
1、下载相关软件，需要下载三个文件，需要用的是jboss-5.1.0.GA(jboss 安装程序) ，mod_cluster-1.0.10.GA-windows-x86-ssl(mod_cluster这个版本已经带...
分类：
其他好文 时间：
2014-12-06 11:27:59
阅读次数：
321
Triangle Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, give...
分类：
其他好文 时间：
2014-12-06 06:33:39
阅读次数：
186
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[
[2],
[3,4],
[...
分类：
其他好文 时间：
2014-12-05 22:50:19
阅读次数：
151
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
You may only use constant extra ...
分类：
其他好文 时间：
2014-12-05 22:48:46
阅读次数：
139
A peak element is an element that is greater than its neighbors.
Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.
You may imagine that num[-1] = num[n] = -∞.
...
分类：
其他好文 时间：
2014-12-05 21:25:52
阅读次数：
198
