09 2012 档案

The size of two dimension pointer
摘要：1: //:c08:Quoter.cpp 2: //random quote selection 3: /* 4: *C++编程思想第八章，关于const成员函数的例子 5: *这个例子说明，const对象只能调用cosnt成员函数，例子利用随机数生成器构造了 6: *一个选举器，每次都从若干句话中选出与上次不同的一句话，打印输出。 7: *时间：201... 阅读全文
posted @ 2012-09-01 23:42 justinzhang 阅读(372) 评论(0) 推荐(0) 编辑
pointer and const
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-30 16:58:38 5: desc:for the practice of interview problem 6: */ 7: #include <iostream> 8: using na... 阅读全文
posted @ 2012-09-01 23:41 justinzhang 阅读(281) 评论(0) 推荐(0) 编辑
优先级队列
摘要：1: //file :4pqueue-test.cpp 2: #include <queue> 3: #include <iostream> 4: #include <algorithm> 5: using namespace std; 6: 7: int main() 8: { 9: //test priority queue..... 阅读全文
posted @ 2012-09-01 23:40 justinzhang 阅读(264) 评论(0) 推荐(0) 编辑
stl iterator traits
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-23 10:28:53 5: desc: value_type , from <the annotated stl source>, chapter 3, p86 6: iterator_traits wil... 阅读全文
posted @ 2012-09-01 23:38 justinzhang 阅读(228) 评论(0) 推荐(0) 编辑
mmap from man
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time：2012-8-22 16:23:08 5: desc: mmap()practice from man mmap 6: */ 7: #include <sys/mman.h> 8: #include <sys/... 阅读全文
posted @ 2012-09-01 23:35 justinzhang 阅读(445) 评论(0) 推荐(0) 编辑
管道学习
摘要：1: /* 2: @@ 3: Author: JustinZhang 4: Email: uestczhangchao@gmail.com 5: Time: 2012-9-1 23:32:22 6: desc: Example from man, write by hand, test under ubu... 阅读全文
posted @ 2012-09-01 23:34 justinzhang 阅读(272) 评论(0) 推荐(0) 编辑
memcpy和mmap
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-22 18:50:23: 5: desc: a buggy program from bbs.qshpan.com, i use strerror(errno) to locate 6: the proble... 阅读全文
posted @ 2012-09-01 23:31 justinzhang 阅读(1044) 评论(0) 推荐(0) 编辑
fork的微妙问题2
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-30 22:53:33 5: desc: from a interview question, fork plus printf buffer is a littel tricky~~ 6: */ 7: ... 阅读全文
posted @ 2012-09-01 23:30 justinzhang 阅读(178) 评论(0) 推荐(0) 编辑
fork的微妙问题1
摘要：1: /* 2: Author:Justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-30 22:17:23 5: desc：fork problem, from www.qshpan.com 6: */ 7: 8: #include <stdio.h> 9: #inclu... 阅读全文
posted @ 2012-09-01 23:29 justinzhang 阅读(302) 评论(0) 推荐(0) 编辑
二分查找的递归和非递归实现
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-30 18:54:01 5: desc: binary search from the aocp p380 6: */ 7: 8: #include <iostream> 9: #incl... 阅读全文
posted @ 2012-09-01 23:28 justinzhang 阅读(1720) 评论(0) 推荐(0) 编辑
二叉树的递归创建和遍历
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-20 15:52:27 5: des.:using non recursive method to traverse binary tree 6: */ 7: #include <iostream> ... 阅读全文
posted @ 2012-09-01 23:26 justinzhang 阅读(287) 评论(0) 推荐(0) 编辑
字符串拷贝
摘要：1: /* 2: @@ 3: Author: Justinzhang 4: Email: uestczhangchao@gmail.com 5: Time: 2012-9-1 22:08:31 6: Desc: It's a problem meet a long time ago. i've tried... 阅读全文
posted @ 2012-09-01 23:24 justinzhang 阅读(261) 评论(0) 推荐(0) 编辑
旋转字符串
摘要：1: /* 2: author:justinzhang 3: email:uestczhangchao@gmail.com 4: time:2012-8-19 9:44:46 5: des.: to left rotate a string,e.g, abcedef->cedefab 6: */ 7: 8: #include <iostream>... 阅读全文
posted @ 2012-09-01 23:20 justinzhang 阅读(241) 评论(0) 推荐(0) 编辑
连续子数组的最大和
摘要：1: /* 2: @@ 3: Author: Justinzhang 4: Email: uestczhangchao@gmail.com 5: time: 2012-9-1 21:40:13 6: desc: find the max sum of sub arrys; This file was cr... 阅读全文
posted @ 2012-09-01 23:19 justinzhang 阅读(229) 评论(0) 推荐(0) 编辑
双向循环链表
摘要：1: /* 2: @@ 3: Author: justinzhang 4: Email: uestczhangchao@gmail.com 5: Time: 2012-9-1 20:37:37 6: desc: double list related code 7: */ 8: #include <iostream> 9: #inc... 阅读全文
posted @ 2012-09-01 23:17 justinzhang 阅读(218) 评论(0) 推荐(0) 编辑
单向链表
摘要：/*@@author:justinzhangemail:uestczhangchao@gmail.comtime:2012-9-1 18:51:44desc: all the list related operation will be place here; including: 1> combine_list(list<type> *l1, list<type>* l2);... 阅读全文
posted @ 2012-09-01 23:16 justinzhang 阅读(221) 评论(0) 推荐(0) 编辑
百度之星05-1
摘要：/************************************************************************* Author:justinzhang* Email:uestczhangchao@gmail.com* Time：2011年5月26日19:42:29* Discription:百度之星-05年，第一题，一个整数可以表示为n个连续整数之和。****... 阅读全文
posted @ 2012-09-01 23:14 justinzhang 阅读(235) 评论(0) 推荐(0) 编辑