码迷,mamicode.com
首页 >  
搜索关键字:i need a offer    ( 7760个结果
剑指OFFER之把数组排成最小的数(九度OJ1504)
题目描述:输入一个正整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。例如输入数组{3,32,321},则打印出这三个数字能排成的最小数字为321323。输入:输入可能包含多个测试样例。对于每个测试案例,输入的第一行为一个整数m (10 ; i-- ){ ...
分类:其他好文   时间:2014-06-28 22:46:04    阅读次数:318
剑指OFFER之第一个只出现一次的字符(九度OJ1283)
题目描述:在一个字符串(1#include int main(){ int i; char c[10000]; int cnt[24]; while(scanf("%s",&c)!=EOF){ memset(&cnt,0,sizeof(int)*24); ...
分类:其他好文   时间:2014-06-28 12:31:02    阅读次数:231
【剑指offer】八皇后问题
转载请注明出处:http://blog.csdn.net/ns_code/article/details/26614999 剑指offer上解决八皇后问题,没实用传统的递归或非递归回溯法,而是用了非常巧妙的全排列法。 先说下八皇后问题:在8 X 8的国际象棋上摆放八个皇后,使其不能相互攻击,即随.....
分类:其他好文   时间:2014-06-22 23:52:46    阅读次数:398
NYOJ353 3D dungeon 【BFS】
3D dungeon 时间限制:1000 ms  |  内存限制:65535 KB 难度:2 描述You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be fil...
分类:其他好文   时间:2014-06-22 22:13:18    阅读次数:223
[转]SSL on Open vSwitch and ovs controller
There are two places that SSL will need to be configured if SSL is to be used between the controller and the Open vSwtich. The instructions below assu...
分类:其他好文   时间:2014-06-21 15:30:08    阅读次数:161
CCNA 4.14 TP Correction
All people seem to need data processing( Application presentation session transport network data link physic )host : end device ( PC Server )switch : ...
分类:其他好文   时间:2014-06-21 00:01:08    阅读次数:493
include/linux/tasks.h
#ifndef _LINUX_TASKS_H#define _LINUX_TASKS_H/** This is the maximum nr of tasks - change it if you need to*///最大的进程数量#define NR_TASKS 128#endif
分类:系统相关   时间:2014-06-20 17:29:36    阅读次数:290
6 Java Exceptions that Haunts a Newbie Java Developer(Java菜鸟6种常见的异常)
Every now and then, I come across various newbies Java developers who are found to get stuck with some of the following common exceptions where I need...
分类:编程语言   时间:2014-06-20 17:19:52    阅读次数:325
剑指OFFER之丑数(九度OJ1214)
题目描述:把只包含因子2、3和5的数称作丑数(Ugly Number)。例如6、8都是丑数,但14不是,因为它包含因子7。习惯上我们把1当做是第一个丑数。求按从小到大的顺序的第N个丑数。输入:输入包括一个整数N(1#define MAXSIZE 1500void mkUglyNumber();int...
分类:其他好文   时间:2014-06-20 16:56:31    阅读次数:197
HDU-3473Minimum Sum
Problem Description You are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a number x to make as small as possible! ...
分类:其他好文   时间:2014-06-18 00:58:54    阅读次数:276
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!