Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given s...
分类：
其他好文 时间：
2015-02-23 09:35:10
阅读次数：
133
一、Hibernate之1-N关联映射1. 哪边是 1 ， 哪边是多 ？ 须要从业务的角度来说明。比如，Employee 和 Department 之间就是 n-1 的关联关系，Order 和 Customer 之间也是 n-1 的关联关系。 1）. 关联关系是有方向的： 2）. 怎样在类中来...
分类：
Web程序 时间：
2015-02-22 14:34:46
阅读次数：
180
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al...
分类：
其他好文 时间：
2015-02-21 15:26:40
阅读次数：
185
As we said before, we need a delegate to deal with the user interaction with the camera or the photo library. In order to do that we have to conform t...
分类：
其他好文 时间：
2015-02-20 13:02:48
阅读次数：
105
传送门：http://poj.org/problem?id=1094
Sorting It All Out
Description
An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elem...
分类：
其他好文 时间：
2015-02-20 09:46:55
阅读次数：
159
使用scott账户下的dept表；select * from dept order by deptno;10 ACCOUNTING NEW YORK20 RESEARCH DALLAS30 SALES CHICAGO40 OPERATIONS BOSTON为了演示方便，插入一条数据：insert i...
分类：
数据库 时间：
2015-02-20 01:27:10
阅读次数：
209
Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order....
分类：
其他好文 时间：
2015-02-19 20:42:09
阅读次数：
222
For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decre...
分类：
其他好文 时间：
2015-02-19 12:54:32
阅读次数：
138
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
题...
分类：
其他好文 时间：
2015-02-18 19:57:53
阅读次数：
216
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.这道题是要求把有序链表转为二叉搜索树，和之前那道Convert Sorted Ar...
分类：
其他好文 时间：
2015-02-18 08:24:13
阅读次数：
160
