码迷,mamicode.com
首页 >  
搜索关键字:each    ( 14050个结果
mysql 触发器语法详解
1、创建Mysql触发器: 语法: CREATE TRIGGER trigger_name trigger_time trigger_event ON tbl_name FOR EACH ROW BEGIN trigger_stmt //语句块 END; CR...
分类:数据库   时间:2014-05-09 10:52:24    阅读次数:478
hust 1009 Sum the K-th
题目描述N integers are arranged on a circle clockwise. Given two integers M and K. For each position, you should take M continuous integers on the left an...
分类:其他好文   时间:2014-05-09 10:30:49    阅读次数:350
有关Cache –(1) linux list之中的Prefetc
转载:http://www.kernelchina.org/node/1050linux的list实现之中有如下东东:#define list_for_each(pos, head) \ for (pos = (head)->next; prefetch(pos->next), pos != (h....
分类:系统相关   时间:2014-05-09 10:04:38    阅读次数:323
VC下勉强可用的list
linux内核中的list太好用了,可惜VC编译器不支持 typeof关键字,将linux内核中的list直接移植过来不能用修改所有与typeof相关的代码后,终于可以勉强在VC下运行起来了,但是还不完美,list_for_each_entry和list_for_each_entry_safe需要增...
分类:其他好文   时间:2014-05-09 08:57:19    阅读次数:603
leetcode -day11 Clone Graph & Palindrome Partitioning I II
1、Clone Graph Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as...
分类:其他好文   时间:2014-05-09 02:17:58    阅读次数:336
ZOJ 3780 Paint the Grid Again(topsort)
ZOJ Problem Set - 3780 Paint the Grid Again Time Limit: 2 Seconds      Memory Limit: 65536 KB Leo has a grid with N × N cells. He wants to paint each cell with a specific color (either black ...
分类:其他好文   时间:2014-05-09 02:00:35    阅读次数:506
[LeetCode][Java]Triangle@LeetCode
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol...
分类:编程语言   时间:2014-05-08 18:31:51    阅读次数:399
[LeetCode][Java]Candy@LeetCode
CandyThere areNchildren standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following ...
分类:编程语言   时间:2014-05-08 15:29:54    阅读次数:411
深度优先搜索两个实例
参考算法导论第三版中译本,DFS的Pseudocode如下: 1 DFS(G) 2 for each vertex u ∈ G.V 3 u.color = WHITE 4 u.π = NIL 5 time = 0 6 for each ve...
分类:其他好文   时间:2014-05-08 06:44:52    阅读次数:380
leetcode第一刷_Populating Next Right Pointers in Each Node
这道题之前没见过,一上来还真不知道怎么做。问题的限制条件,树是完全二叉树其实并不是关键,只不过是一个简化的条件而已。那关键是什么呢?如何从当前节点跳到下一个开始的节点。我的做法是,每次从一层的最左边节点开始,一层一层的走。其实只有两种形式的next指针需要我们来更新,第一种,同一个节点的左右孩子,第二种,父亲相邻时,左边父亲的右孩子和右边父亲的左孩子之间。完全二叉树的简化就体现在更新的过程,因为完...
分类:其他好文   时间:2014-05-08 04:02:43    阅读次数:324
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!