码迷,mamicode.com
首页 >  
搜索关键字:check    ( 9197个结果
The end of other
The end of otherFor language training our Robots want to learn about suffixes.In this task, you are given a set of words in lower case. Check whether ...
分类:其他好文   时间:2014-08-05 10:51:49    阅读次数:196
LeetCode "Recover Binary Search Tree"
An example of in-order traversal application. My intuition is that, we have to serialize it into an array and check, but in-order traversal does exact...
分类:其他好文   时间:2014-08-05 03:03:48    阅读次数:241
[LeetCode 题解]: Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ...
分类:其他好文   时间:2014-08-05 00:37:38    阅读次数:233
Cacti+Nagios监控系统(五):Nagios监控windows(基于check_nt)
一、工作原理Nagios服务器使用check_nt工具与客户端程序通讯,客户端程序NSCP使用命令来获取本地客户端的信息并返回给check_nt。check_nt只是NSCP其中一项服务,Nagios还可以通过check命令(如check_http检查WEB服务)、check_nrpe、NSCA、WMI来监控windows客户端。二、下载客..
分类:移动开发   时间:2014-08-04 18:22:08    阅读次数:453
rhca 442 kernel module
##Manage Kernel Modules display modules >lsmod Check modules parameters >modinfo -p usb_storage|st|sc8 Load modules >modprobe usb_storage|st|sc8 Rmove mdules > rmmod usb_storage|st|sc8 ###Set defau...
分类:其他好文   时间:2014-08-04 14:47:07    阅读次数:247
Float Equal Problem
Understand limitations of floating point representations.Never check for equality with ==. Instead, check if the difference is less than an epsilon va...
分类:其他好文   时间:2014-08-04 14:13:17    阅读次数:235
[LeetCode]Same Tree
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. /** ...
分类:其他好文   时间:2014-08-03 12:54:55    阅读次数:201
Thesis - Preparation
1. Choose a topic.2. Decide what to develop.3. Check feasibility of your idea, including the tools, time, etc.4. If feasible, write a project proposal...
分类:其他好文   时间:2014-08-02 20:38:53    阅读次数:197
POJ 1035 Spell Check 字符串处理
被这样的题目忽悠了,一开始以为使用Trie会大大加速程序的,没想到,一不小心居然使用Trie会超时。 最后反复试验,加点优化,终于使用Trie是可以过的,不过时间大概难高于1500ms,一不小心就会超时。 看来这是一道专门卡Trie的题目,只好放弃不使用Trie了。 也得出点经验,如果字符串很多,如本题有1万个字符串的,那么还是不要使用Trie吧,否则遍历一次这样的Trie是十分耗时的,2s...
分类:其他好文   时间:2014-08-02 15:30:03    阅读次数:245
poj 1035
Spell checker Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19044   Accepted: 6959 Description You, as a member of a development team for a new spell check...
分类:其他好文   时间:2014-08-02 13:00:53    阅读次数:262
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!