码迷,mamicode.com
首页 >  
搜索关键字:a tree game 博弈    ( 25212个结果
Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.思路:由前序遍历数组和中序遍历...
分类:其他好文   时间:2014-04-30 02:20:33    阅读次数:366
Mine Number(搜索,暴力) ACM省赛第三届 G
Mine NumberTime Limit: 1000ms Memory limit: 65536K有疑问?点这里^_^题目描述Every one once played the game called Mine Sweeping, here I change the rule. You are g...
分类:其他好文   时间:2014-04-30 01:05:41    阅读次数:857
Binary Tree Postorder Traversal
借助堆栈完成迭代形式的后序遍历
分类:其他好文   时间:2014-04-29 19:22:59    阅读次数:404
Binary Tree Preorder Traversal
借助堆栈完成迭代形式的先序遍历。
分类:其他好文   时间:2014-04-29 19:03:25    阅读次数:474
《Cracking the Coding Interview》——第17章:普通题——题目2
2014-04-28 22:05题目:写个程序判断三连棋哪一方赢了。解法:三个相同的棋子连成一条横线,竖线或者对角线就判断为赢了。代码: 1 // 17.2 Write an algorithm to check if someone has won the tic-tac-toe game. 2 ...
分类:其他好文   时间:2014-04-29 18:12:07    阅读次数:474
Conceptual blockbusting - chap3 Emotional blocks
Barnyard game -- People will often avoid conceptualization, or at least avoid publicizing the output because expression of new ideas sometimes makes y...
分类:其他好文   时间:2014-04-29 17:12:24    阅读次数:501
whatweb tree
.├── 1.txt├── addons│ ├── country-scanner│ ├── gggooglescan│ ├── hunter│ └── verify-nikto├── CHANGELOG├── INSTALL├── lib│ ├── colour.rb│ ├── extend-ht...
分类:Web程序   时间:2014-04-28 14:10:38    阅读次数:4375
sdut 2416:Fruit Ninja II(第三届山东省省赛原题,数学题)
Fruit Ninja IITime Limit: 5000MS Memory limit: 65536K题目描述Have you ever played a popular game named "Fruit Ninja"?Fruit Ninja (known as Fruit Ninja HD ...
分类:其他好文   时间:2014-04-28 05:10:47    阅读次数:582
△2013山东省ACM竞赛-Alice and Bob
Alice and BobDescriptionAlice and Bob like playing games very much.Today, they introduce a new game.There is a polynomial like this: (a0*x^(2^0)+1) * ...
分类:其他好文   时间:2014-04-28 02:50:32    阅读次数:357
leetcode day4 -- Binary Tree Postorder(Preorder) Traversal && Edit Distance
?? 1、Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 retu...
分类:其他好文   时间:2014-04-27 18:58:59    阅读次数:481
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!