Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x.Use two addit...
分类:
其他好文 时间:
2014-07-09 17:44:36
阅读次数:
159
Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, s1 and s2, write code to check if s2 is a ...
分类:
其他好文 时间:
2014-07-08 21:44:23
阅读次数:
177
Description
Imagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. T...
分类:
其他好文 时间:
2014-07-08 21:04:29
阅读次数:
347
二维码(Two-dimensional code)是用某种特定的几何图形按一定规律在平面(二维方向)分布的黑白相间的图形记录数据符号信息的方式。现实生活中,二维码普遍存在我们的周围,例如:产品防伪/溯源、广告推送、网站链接、数据下载、商品交易、定位/导航、电子凭证、车辆管理、信息传递、名片交流、wifi共享等。
在代码编制上巧妙地利用构成计算机内部逻辑基础的“0”、“1”比特流的概念,使...
分类:
其他好文 时间:
2014-07-08 20:07:51
阅读次数:
260
Designing a Class Interface
设计类接口
The Objective-C syntax for creating a class is very simple. It typically comes in two parts.
创建类的语法是很简单的,通常包括两部分。
The class interface is u...
分类:
其他好文 时间:
2014-07-08 16:24:27
阅读次数:
168
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process ...
分类:
其他好文 时间:
2014-07-08 14:12:32
阅读次数:
226
题目
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant spac...
分类:
其他好文 时间:
2014-07-08 13:46:26
阅读次数:
205
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1’s ...
分类:
其他好文 时间:
2014-07-08 13:34:40
阅读次数:
195
Flip Game
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 29713
Accepted: 12876
Description
Flip game is played on a rectangular 4x4 field with two-sided...
分类:
其他好文 时间:
2014-07-08 13:32:49
阅读次数:
189
题意:N个点(0~n-1),M条无向边,问去掉2个点后最多的连通分块有多少。
先去掉一个点求出各个割点,并在dfs过程中求出去掉这个割点有多少个连通分块(将iscut[u]=true改为iscut[u]++),
这样子第二次就可以直接找出最多的连通分块了。
#include
#include
#include
#include
#include
#include
#inclu...
分类:
其他好文 时间:
2014-07-08 13:06:23
阅读次数:
145