码迷,mamicode.com
首页 >  
搜索关键字:note    ( 7358个结果
LeetCode-94 Binary Tree Inorder Traversal
Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note...
分类:其他好文   时间:2015-01-22 01:34:22    阅读次数:170
[LeetCode] Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ...
分类:其他好文   时间:2015-01-22 00:10:30    阅读次数:188
leetcode 【 Merge Sorted Array 】python 实现
题目:Given 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 is greater or eq...
分类:编程语言   时间:2015-01-21 23:53:45    阅读次数:175
linux grub启动密码验证设置
1、认识启动配置选项[root@server5 ~]# cat /boot/grub/grub.conf # grub.conf generated by anaconda## Note that you do not have to rerun grub after making changes....
分类:系统相关   时间:2015-01-21 21:48:06    阅读次数:254
multithreading - Reader/Writer Locks in C++
You Only Need To Note This: only 1single thread can acquire an upgrade_lock at one time.others are very straightforward.96vote1800 INFORMATION is more...
分类:编程语言   时间:2015-01-20 20:01:12    阅读次数:183
手游外设,小旗捡了小米的漏吗?
15日,亿万米粉怀着激动的心情迎来了他们的节日,官方营销火力全开,小米note好,海报做地更好,还发布了小米小盒子,两日之后,包含多功能网关、人体感应器、门窗传感器、无线开关、门铃,支持WiFi、Zigbee协议的小米智能家庭套装亮相。如今小米已把能做的、不能做到都做了,..
分类:移动开发   时间:2015-01-20 18:38:49    阅读次数:181
note
求平均数 double=(数字的和)/4.0 除以浮点数IO-04. 混合类型数据格式化输入#include #include /* run this program using the console pauser or add your own getch, system("pause") or...
分类:其他好文   时间:2015-01-20 15:26:10    阅读次数:158
【原创】leetCodeOj --- Factorial Trailing Zeroes 解题报告
原题地址:https://oj.leetcode.com/problems/factorial-trailing-zeroes/题目内容:Given an integern, return the number of trailing zeroes inn!.Note:Your solution s...
分类:其他好文   时间:2015-01-20 00:49:43    阅读次数:182
Binary Tree Inorder Traversal
本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/42876657 Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,3,2]. Note: Re...
分类:其他好文   时间:2015-01-19 21:11:04    阅读次数:184
Binary Tree Preorder Traversal
本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/42876699 Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,2,3]. Note: Re...
分类:其他好文   时间:2015-01-19 21:09:52    阅读次数:145
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!