摘要: 有网友提到基本配置文件,字体,输入法,驱动安装,我都觉得 这些不是一开始使用Linux需要学习的东西,比如我现在对字体 配置还不明白,呵呵,学习下面这些东西最好就在虚拟终端下, 不要弄 X 界面了。 谢谢cathayan, roy, analyz, potator等网友的建议! ========================================================= ... 阅读全文
posted @ 2007-09-22 20:03 HonestMan 阅读(220) 评论(0) 推荐(0) 编辑
摘要: void permutation(char *Pbegin, char *Pend) { if(!Pbegin || !Pend) return; /////////////////////// //if Pbegin equal to Pend //this round is finished //print if(*Pend) ... 阅读全文
posted @ 2007-09-21 22:46 HonestMan 阅读(220) 评论(0) 推荐(0) 编辑
摘要: Q: An int array, devide an array of integers into two parts, odd in the first part, and even in the second part. We need some sub Function: 1: IsEven(int n) // n is Even or not 2: void Reorder(int *p... 阅读全文
posted @ 2007-09-21 22:05 HonestMan 阅读(181) 评论(0) 推荐(0) 编辑
摘要: Working for Google is an aspiration for some. For other it’s the possibility of lucrative stock options, incredible snack bars or cool offices that lure them. A lot of people out there would like to ... 阅读全文
posted @ 2007-09-21 17:51 HonestMan 阅读(820) 评论(0) 推荐(0) 编辑
摘要: Writing Better Code How to Interview a Programmer by Bill Venners February 24, 2003 Summary Recognizing good programmers among job applicants is not easy. This article contains interview techniques,... 阅读全文
posted @ 2007-09-19 22:28 HonestMan 阅读(841) 评论(0) 推荐(0) 编辑
摘要: This is a question from Microsoft, in general, recurtion is first tip on binary tree. Convert a Binary search tree to double linked list, and no new point, only change pointer. for example: ... 阅读全文
posted @ 2007-09-19 17:22 HonestMan 阅读(1275) 评论(0) 推荐(0) 编辑
摘要: /* Given a binary tree, return true if a node with the target data is found in the tree. Recurs down the tree, chooses the left or right branch by comparing the target to each node. */ bool ... 阅读全文
posted @ 2007-09-19 09:05 HonestMan 阅读(199) 评论(0) 推荐(0) 编辑
摘要: spilt a list and become two sublists void spilt(struct node *source, struct node** front, struct code** back){ int len = count(source); int i; struct node* current =source; if(lennext;... 阅读全文
posted @ 2007-09-18 21:12 HonestMan 阅读(424) 评论(3) 推荐(0) 编辑
摘要: I know it's very simple but not easy. I decieded that I write it by hand. its similar to strLen funtion Maybe i am a dummy. I use C. version 1 int Count(char *s){ int n=0; while(*s){ n... 阅读全文
posted @ 2007-09-18 20:05 HonestMan 阅读(162) 评论(0) 推荐(0) 编辑
摘要: i search in google to find the solution remove repeat char from a string, but failed. so write it by myselft.... i use C. char * RemoveRepeatChar(char *S){ char *temp=S, *move; //1. base ==Null if(*s... 阅读全文
posted @ 2007-09-18 15:13 HonestMan 阅读(559) 评论(4) 推荐(0) 编辑