<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[JG_Dong的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/JG_Dong</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; JG_Dong]]></copyright><item><title><![CDATA[RoboCup2D team_logo]]></title><link>https://blog.youkuaiyun.com/JG_Dong/article/details/51114368</link><guid>https://blog.youkuaiyun.com/JG_Dong/article/details/51114368</guid><author>JG_Dong</author><pubDate>Sun, 10 Apr 2016 21:20:59 +0800</pubDate><description><![CDATA[Due to the popularity of robocup, many Chinese college students in the study, but as a famous team, is the need to have a belong to his own team team logo, like school, has its own crest. Below, I intr]]></description><category></category></item><item><title><![CDATA[简单的二叉树创建及其基本的运算（C语言）]]></title><link>https://blog.youkuaiyun.com/JG_Dong/article/details/49591303</link><guid>https://blog.youkuaiyun.com/JG_Dong/article/details/49591303</guid><author>JG_Dong</author><pubDate>Mon, 02 Nov 2015 20:10:05 +0800</pubDate><description><![CDATA[/*
本程序采用的是递归调用算法，操作简单，理解较难


采用的是c++的书写风格，但并不是c++类的思想，使用的认为C语言的编程思想
*/
#include
using namespace std;


typedef char elementType;
typedef struct BLNode
{
    elementType data;
    struct ]]></description><category></category></item><item><title><![CDATA[二维数组的鞍点问题（c++）]]></title><link>https://blog.youkuaiyun.com/JG_Dong/article/details/45751035</link><guid>https://blog.youkuaiyun.com/JG_Dong/article/details/45751035</guid><author>JG_Dong</author><pubDate>Fri, 15 May 2015 22:45:33 +0800</pubDate><description><![CDATA[/*
用C++编写程序：找出二维数组鞍点，即该位置上的元素行最大，列最小，cout输出，当然可能没有鞍点。
数组100*100
int型
eg:
1 2 3 4
      5
随机数 6
      7
 4就是鞍点 
用随机数（0-99）填充
*/


#include
#include
#include 
using namespace std;
int ]]></description><category></category></item></channel></rss>