码迷,mamicode.com
首页 >  
搜索关键字:values    ( 8569个结果
Swift 初见
http://numbbbbb.gitbooks.io/-the-swift-programming-language-/chapter1/02_a_swift_tour.html本页内容包括:简单值(Simple Values)控制流(Control Flow)函数和闭包(Functions an...
分类:其他好文   时间:2014-06-28 18:55:25    阅读次数:279
SQL学习分享(二)
1、插入数据insert into table(id,name) values("","") ---插入数据到table表中如:INSERT INTO sms.Communication ( RefType,RefId,Type,Message,CreateUserId,CreateDate ) v...
分类:数据库   时间:2014-06-28 18:36:01    阅读次数:239
SQL CTE 递归 查询省,市,区
IF OBJECT_ID('tb') IS NOT NULL DROP TABLE tbcreate table tb(id varchar(3) , pid varchar(3) , name varchar(10))insert into tb values('001' , null ,...
分类:数据库   时间:2014-06-28 17:58:36    阅读次数:470
算法: 排序: 快速排序
1. Algrithom?Given an array of values, pick a value as a pivot value?Check each value against the pivot value and - bring each value higher than the p...
分类:其他好文   时间:2014-06-28 13:41:01    阅读次数:201
[LeetCode] Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example, Given n = 3, there are a total of 5 unique BST'...
分类:其他好文   时间:2014-06-28 11:57:50    阅读次数:232
mysql 命令整理
登录命令mysql -uroot -p21313新建用户insert into mysql.user(Host,User,Password) values("localhost","phplamp",password("1234"));刷新权限flush privileges;创建数据库create...
分类:数据库   时间:2014-06-21 07:39:29    阅读次数:263
Leetcode Binary Tree Preorder Traversal
Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not...
分类:其他好文   时间:2014-06-21 06:40:07    阅读次数:172
Leetcode Binary Tree Postorder Traversal
Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No...
分类:其他好文   时间:2014-06-21 06:31:43    阅读次数:265
mfc中 控件 对话框 添加颜色 背景图片
1 设置对话框透明在设置控件颜色中要使用nCtlColor Contains one of the following values, specifying the type of control:CTLCOLOR_BTNButton controlCTLCOLOR_DLGDialog boxCTL...
分类:其他好文   时间:2014-06-20 20:20:34    阅读次数:240
Leetcode: Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3]...
分类:其他好文   时间:2014-06-20 19:37:40    阅读次数:136
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!