<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Godwin_Q</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Godwin_Q]]></copyright><item><title><![CDATA[Linux查看文件系统格式类型]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/46288369</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/46288369</guid><author>Godwin_Q</author><pubDate>Sun, 31 May 2015 14:18:55 +0800</pubDate><description><![CDATA[在Linux下查看文件系统的格式如EXT2,EXT3有几种方法

方法一:

输入

df -T

方法二:

输入

mount

记住不要任务参数

方法三:

cat /etc/fstab










原文网址：]]></description><category></category></item><item><title><![CDATA[二叉树的镜像问题]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/46054131</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/46054131</guid><author>Godwin_Q</author><pubDate>Wed, 27 May 2015 22:09:18 +0800</pubDate><description><![CDATA[//来源于剑指offer 

typedef char DataType;

//二叉树的镜像
void  MirrorRecursively(TreeNode* tree)
{
	if(tree==NULL)
	{
		return;
	}
	if(tree->leftchild==NULL && tree->rightchild==NULL)
	{
		return;
	}
	TreeNode]]></description><category></category></item><item><title><![CDATA[判断一棵树是否为平衡二叉树]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/46053745</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/46053745</guid><author>Godwin_Q</author><pubDate>Wed, 27 May 2015 21:57:20 +0800</pubDate><description><![CDATA[typedef char DataType;

typedef struct TNode
{
	DataType value;
	struct TNode* leftchild;
	struct TNode* rightchild;
}TreeNode;


//求解树的高度 
int TreeDepth(TreeNode* tree)
{
	if(tree==NULL)
	{
		return ]]></description><category></category></item><item><title><![CDATA[判断两棵树是否相等]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/46053535</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/46053535</guid><author>Godwin_Q</author><pubDate>Wed, 27 May 2015 21:48:14 +0800</pubDate><description><![CDATA[typedef struct TNode
{
	DataType value;
	struct TNode* leftchild;
	struct TNode* rightchild;
}TreeNode;


int CompTree(TreeNode* tree1,TreeNode* tree2)
{
	if(tree1==NULL&&tree2==NULL)
		return 1;
	if]]></description><category></category></item><item><title><![CDATA[简单的函数指针问题]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45974245</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45974245</guid><author>Godwin_Q</author><pubDate>Mon, 25 May 2015 20:42:26 +0800</pubDate><description><![CDATA[#include
using namespace std;

int max(int a,int b)
{
	return (a>b)?a:b;
}



int main()
{
	int (*f)(int,int) = &max;
	int a,b,c;
	cin >> a >> b >> c;	
	cout << (*f)((*f)(a,b),c) << endl;
	return 0;
}]]></description><category></category></item><item><title><![CDATA[一个简单的链表实现]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45952275</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45952275</guid><author>Godwin_Q</author><pubDate>Sun, 24 May 2015 15:25:31 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;

typedef struct student
{
	int data;
	struct student* next;	
}node;


node* create()
{
	node*head,*p,*s;
	int x,cycle = 1;
	
	head = (node*)malloc(sizeo]]></description><category></category></item><item><title><![CDATA[数组重排问题]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45938255</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45938255</guid><author>Godwin_Q</author><pubDate>Sat, 23 May 2015 22:44:45 +0800</pubDate><description><![CDATA[#include
using namespace std;

void Arrange(int a[],int len)
{
	int i,j = len-1;
	for(i=len-1;i>=0;--i)
	{
		if(a[i]!=0)
		{
			if(a[j]==0)
			{
				a[j] = a[i];
				a[i] = 0;
			}
			--j;
		}
	}
}]]></description><category></category></item><item><title><![CDATA[旋转数组的最小值问题]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45936085</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45936085</guid><author>Godwin_Q</author><pubDate>Sat, 23 May 2015 17:53:12 +0800</pubDate><description><![CDATA[#include 
using namespace std;

//旋转数组的最小数字 
int Min(int* numbers, int len)
{
	if(numbers==NULL || len<=0)
	{
		return -1;
	}
    
    int index1 = 0;
    int index2 = len-1;
    int indexMid = index1]]></description><category></category></item><item><title><![CDATA[逆序输出链表元素]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45897357</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45897357</guid><author>Godwin_Q</author><pubDate>Thu, 21 May 2015 21:46:07 +0800</pubDate><description><![CDATA[关键代码：
struct ListNode
{
	int m_nKey;
	ListNode* m_pNext;
};

//法一使用栈的方法 
void PrintListReversingly_Iteratively(ListNode* pHead)
{
	std::stack nodes;
	ListNode* pNode = pHaed;
	while(pNode!=NULL)
	{
	]]></description><category></category></item><item><title><![CDATA[linux 下怎么编译生成a.out文件？]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45875865</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45875865</guid><author>Godwin_Q</author><pubDate>Wed, 20 May 2015 21:50:40 +0800</pubDate><description><![CDATA[编辑保存源文件后 在shell中执行  gcc  test.c

  如果没有编译错误，gcc会在当前目录下生成一个a.out文件， 然后可以   ./a.out     结果出来了

当然你也可以使用 –o 选项给生成的文件起一个别的名字，像 gcc test.c –o test , 则gcc会生成一个名为test的可执行文件

点击打开链接]]></description><category></category></item><item><title><![CDATA[编程之美 - 求数组的子数组之和的最大值]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45851687</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45851687</guid><author>Godwin_Q</author><pubDate>Tue, 19 May 2015 22:50:44 +0800</pubDate><description><![CDATA[#include
using namespace std;

int max(int a,int b)
{
	return (a>b)?a:b;
}

int MaxSum(int A[],int n)
{
	int nStart = A[n-1];
	int nAll = A[n-1];
	for(int i=n-2; i>=0; --i)
	{
		nStart = max(A[i],nSta]]></description><category></category></item><item><title><![CDATA[找出数组之中只出现一次的数字]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45771957</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45771957</guid><author>Godwin_Q</author><pubDate>Sat, 16 May 2015 22:21:59 +0800</pubDate><description><![CDATA[/*
 *Ｎ＋２个数，N个数出现了偶数次，
 *２个数出现了奇数次（这两个数不相等），问用O（1）的空间复杂度，
 *找出这两个数，不需要知道具体位置，只需要知道这两个值。
 */ 
 
 #include 
 using namespace std;
 
 
 //判断indexBit位上是否为1 
 bool IsBit1(int num, unsigned int indexBit)
 {
]]></description><category></category></item><item><title><![CDATA[逆序替换空格 -- 剑指offer]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45727191</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45727191</guid><author>Godwin_Q</author><pubDate>Thu, 14 May 2015 22:09:02 +0800</pubDate><description><![CDATA[#include 
using namespace std;

void ReplaceBlank(char str[], int length)
{
	if(str==NULL || length <= 0)
	{
		return;
	}
	
	int originalLength = 0;
	int numberOfBlank = 0;
	int i = 0;
	while(str[i]!=]]></description><category></category></item><item><title><![CDATA[全排列与组合问题]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45693003</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45693003</guid><author>Godwin_Q</author><pubDate>Wed, 13 May 2015 14:50:54 +0800</pubDate><description><![CDATA[全排列问题：
#include 
using namespace std;  

void permutation(char* a,int k,int m)  
{  
    int i,j;
	static int count = 1; 
    if(k == m)  
    {  cout << "第" << count++ << "种方法是: ";
        for(i=0;i]]></description><category></category></item><item><title><![CDATA[Linux命令面试问题及答案]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45676753</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45676753</guid><author>Godwin_Q</author><pubDate>Tue, 12 May 2015 22:50:05 +0800</pubDate><description><![CDATA[1. 如何暂停一个正在运行的进程，把其放在后台（不运行）？

　　答案：为了停止正在运行的进程，让其在后台运行，我们可以使用组合键 Ctrl+Z。

　　2. 什么是安装Linux所需的最小分区数量，以及如何查看系统启动信息？

　　答案：单独一个/root分区足以执行所有的系统任务，但是强烈建议安装Linux时，需要至少三个分区：/root,/boot,/swap。一个IDE硬盘驱动]]></description><category></category></item><item><title><![CDATA[学习C/C++编程，Linux平台的优势与劣势]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45650101</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45650101</guid><author>Godwin_Q</author><pubDate>Mon, 11 May 2015 22:05:50 +0800</pubDate><description><![CDATA[劣势：

1. 熟悉Linux的人不多，熟悉它需要较长时间。
2. 中文资源不够多，往往不全或者不够新。
3. 过去学的很多windows的东西，到Linux下行不通。
4. 充满Linux风味的vim/emacs上手难，需大量使用才能熟练。
5. 门槛高，初学时学习难度曲线陡峭。



优势：

1. 物以稀为贵，掌握Linux的人，比windows的少很多，而Linux]]></description><category></category></item><item><title><![CDATA[sizeof和strlen比较]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45503633</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45503633</guid><author>Godwin_Q</author><pubDate>Tue, 05 May 2015 15:56:19 +0800</pubDate><description><![CDATA[#include  
#include  
#include
using namespace std;  
  
int main()  
{  
	char s[] = "123456";
	
	cout << strlen(s) << endl;
	cout << sizeof(s)/sizeof(*s) << endl;
	cout << sizeof(s)/sizeof(char) << ]]></description><category></category></item><item><title><![CDATA[寻找和为定值的多个数]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45400281</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45400281</guid><author>Godwin_Q</author><pubDate>Thu, 30 Apr 2015 22:50:46 +0800</pubDate><description><![CDATA[编程求解：
输入两个整数 n 和 m，从数列1，2，3.......n 中 随意取几个数,
使其和等于 m ,要求将其中所有的可能组合列出来。


#include  
#include  
using namespace std;  
 
//全局变量 
listlist1;  

//从1,2....n找到和为sum的数字 
void find_factor(int sum, int]]></description><category></category></item><item><title><![CDATA[字符串逆序]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45285705</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45285705</guid><author>Godwin_Q</author><pubDate>Sun, 26 Apr 2015 08:49:40 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;

/* 
 *Author： http://blog.youkuaiyun.com/godwin_q  
 *程序环境: C—Free5.0  
 *语言:C++
 *功能:字符串逆序  
 */ 
void ReverseOrder(char* s)
{
	char temp;
	int len = strlen]]></description><category></category></item><item><title><![CDATA[快速排序程序代码]]></title><link>https://blog.youkuaiyun.com/Godwin_Q/article/details/45268985</link><guid>https://blog.youkuaiyun.com/Godwin_Q/article/details/45268985</guid><author>Godwin_Q</author><pubDate>Sat, 25 Apr 2015 11:45:14 +0800</pubDate><description><![CDATA[#include
using namespace std;


/*
 *Author： http://blog.youkuaiyun.com/godwin_q 
 *程序环境: C—Free5.0 
 *语言:C++ 
 */

void Swap(int& a, int& b)
{
	int temp = a;
	a = b;
	b = temp;
	
}


int Partion(int a[], i]]></description><category></category></item></channel></rss>