码迷,mamicode.com
首页 >  
搜索关键字:assume    ( 1858个结果
【leetcode刷题笔记】Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character'.'.You may assume that there will be on...
分类:其他好文   时间:2014-07-25 14:18:51    阅读次数:284
[leetcode]Merge Sorted Array
Merge Sorted ArrayGiven two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that i...
分类:其他好文   时间:2014-07-25 02:34:44    阅读次数:162
汇编入门学习笔记 (十四)—— 直接定址表
疯狂的暑假学习之 汇编入门学习笔记 (十四)—— 直接定址表 参考: 《汇编语言》 王爽 第16章 1. 描述单元长度的标号 普通的标号:a,b assume cs:code code segment a:db 1,2,3,4,5,6,7,8 b:dw 0 start: mov si,offset a mov di,offset b mov ah,0 mov cx,8 s: mov al,cs:[si] add cs:[di],ax inc si loop s mov...
分类:其他好文   时间:2014-07-24 10:42:58    阅读次数:235
findmax的实现
1 #include 2 #include 3 #include "printCollection.h" 4 5 using namespace std; 6 7 /** 8 * Return the maximum item in array a. 9 *Assume a.size(...
分类:其他好文   时间:2014-07-22 22:51:38    阅读次数:203
【leetcode刷题笔记】Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n...
分类:其他好文   时间:2014-07-19 22:34:50    阅读次数:196
【leetcode】Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.题解:如下图所示的一棵树: ...
分类:其他好文   时间:2014-07-19 19:00:44    阅读次数:262
【leetcode刷题笔记】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.类似http://www.cn...
分类:其他好文   时间:2014-07-19 18:19:06    阅读次数:243
poj 1328 Radar Installation
Radar Installation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 51305   Accepted: 11514 Description Assume the coasting is an infinite straight line. Land...
分类:其他好文   时间:2014-07-18 23:07:57    阅读次数:278
汇编入门学习笔记 (九)—— call和ret
疯狂的暑假学习之 汇编入门学习笔记 (九)—— call和ret 参考: 《汇编语言》 王爽 第10章 call和ret都是转移指令。 1. ret和retf ret指令:用栈中的数据,修改IP内容,从而实现近转移 相当于: pop ip retf指令:用栈中的数据,修改CS和IP,从而实现远转移 相当于: pop ip pop cs 例子:ret assume cs:code,ss:stack stack segment db 16 dup(1) stack ends code seg...
分类:其他好文   时间:2014-07-16 10:32:37    阅读次数:267
[ACM] POJ 1328 Radar Installation (贪心,区间选点问题)
Radar Installation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 51131   Accepted: 11481 Description Assume the coasting is an infinite straight line. La...
分类:其他好文   时间:2014-07-14 12:58:50    阅读次数:241
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!