Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character'.'.You may assume that there will be on...
分类：
其他好文 时间：
2014-06-26 18:49:23
阅读次数：
216
Setup Cordova
Text Editor / IDE
You may need to prepare an IDE or Editor for working. Here for example, install a Sublime Text 3 over Windows, actually it contains versions of Mac OS as well as Linu...
// -*-c++-*-/** OpenSceneGraph - Copyright (C) 1998-2003 Robert Osfield** This library is open source and may be redistributed and/or modified under* ...
分类：
其他好文 时间：
2014-06-25 13:57:17
阅读次数：
187
在ARC项目中使用performSelector:withObject:函数出现“performSelector may cause a leak because its selector is unknown”。在stackoverflow找到了一个解决方案，地址：http://stackover...
分类：
其他好文 时间：
2014-06-25 13:03:01
阅读次数：
270
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类：
其他好文 时间：
2014-06-25 12:59:40
阅读次数：
202
oracle 11g 中 （oracle 10g） crsctl 的 替换命令
Deprecated Command
Replacement Commands
crs_stat
crsctl check cluster -all
crsctl stat re...
分类：
数据库 时间：
2014-06-25 07:15:02
阅读次数：
379
题目
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 for better legibility)
P A H ...
分类：
其他好文 时间：
2014-06-24 23:59:25
阅读次数：
338
【题目】
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note:
You may not engage in multiple transactions at the same time (i...
分类：
其他好文 时间：
2014-06-24 23:28:43
阅读次数：
223
【题目】
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). H...
分类：
其他好文 时间：
2014-06-24 19:40:53
阅读次数：
240
题目
Given a string S,
find the longest palindromic substring in S.
You may assume that the maximum length of S is
1000, and there exists one unique longest palindromic substring.
方法
...
分类：
其他好文 时间：
2014-06-24 19:36:55
阅读次数：
212
