<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DUAN的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/fduan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fduan]]></copyright><item><title><![CDATA[How To Add The Remi, EPEL And RPMFusion Repositories On CentOS 7]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/49010929</link><guid>https://blog.youkuaiyun.com/fduan/article/details/49010929</guid><author>fduan</author><pubDate>Sat, 10 Oct 2015 00:19:04 +0800</pubDate><description><![CDATA[From: 原文链接CentOS was initially released as an independent RHEL clone, in 2004, but it got affiliated with Red Hat (and became Red Hat property) in January 2014. However, the CentOS developers are part]]></description><category></category></item><item><title><![CDATA[解析简单的算术表达式（第1版）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/45631365</link><guid>https://blog.youkuaiyun.com/fduan/article/details/45631365</guid><author>fduan</author><pubDate>Mon, 11 May 2015 01:35:38 +0800</pubDate><description><![CDATA[解析简单的算术表达式（不含括号），如：2*12/3+3*9/1-3=
这一版本目前尚未添加对特殊情况的处理，如分母为0的情形、表达式中含有非法字符的情形等。


#include 

int parse_expr( char * p, char * q )
{
    int a = 0, b = 0;
    char op;

    while( *p >= '0' && *p <=]]></description><category></category></item><item><title><![CDATA[Test]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/45593991</link><guid>https://blog.youkuaiyun.com/fduan/article/details/45593991</guid><author>fduan</author><pubDate>Sat, 09 May 2015 02:10:25 +0800</pubDate><description><![CDATA[int ex01( LinkedList * lst, int x )
{
    assert( *lst != NULL );
    int n = 0;
    NodePtr p = ( *lst )->next;
    NodePtr r = NULL, q = NULL;
    NodePtr pre = NULL;

    if( p == NULL ) return n;]]></description><category></category></item><item><title><![CDATA[Windows7/Windows Server 2008 右键"选择默认程序"出错解决方案]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8108676</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8108676</guid><author>fduan</author><pubDate>Wed, 24 Oct 2012 20:44:56 +0800</pubDate><description><![CDATA[将下列内容复制到文本文件中，并将扩展名修改为 .reg，双击运行即可。
Windows Registry Editor Version 5.00

[HKEY_CLASSES_ROOT\Unknown]
"AlwaysShowExt"=""
"QueryClassStore"=""
"TypeOverlay"=""

[HKEY_CLASSES_ROOT\Unknown\DefaultIcon]]]></description><category></category></item><item><title><![CDATA[[Java GUI] 在JTextArea中显示选定文件的内容]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8071296</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8071296</guid><author>fduan</author><pubDate>Mon, 15 Oct 2012 03:25:13 +0800</pubDate><description><![CDATA[/**
 * This program opens a file and show its content in a text area.
 * 
 * @author 	fduan
 * @link 	http://blog.youkuaiyun.com/fduan
 */
import javax.swing.*;
import javax.swing.filechooser.FileFilter;
im]]></description><category></category></item><item><title><![CDATA[EM algorithm for GMM in MATLAB]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8070817</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8070817</guid><author>fduan</author><pubDate>Sun, 14 Oct 2012 22:10:18 +0800</pubDate><description><![CDATA[function [label, model, llh] = emgm(X, init)
% EM algorithm for Gaussian mixture model
%% initialization
fprintf('EM for Gaussian mixture: running ... ');
R = initialization(X,init);

tol = 1e-6;
maxi]]></description><category></category></item><item><title><![CDATA[[Java GUI] 简易Java绘图程序实例]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8062556</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8062556</guid><author>fduan</author><pubDate>Thu, 11 Oct 2012 22:11:35 +0800</pubDate><description><![CDATA[本例演示了如何响应鼠标动作来实现绘图，为使重绘时原先信息不丢失，使用了Vector类来保存所绘制的各条曲线，其中curve对象用于保存每条曲线，而curves对象保存所有绘制的独立曲线。

import java.awt.Color;
import java.awt.Container;
import java.awt.Dimension;
import java.awt.Graphics;]]></description><category></category></item><item><title><![CDATA[[Java GUI] 鼠标移动事件处理示例]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8058650</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8058650</guid><author>fduan</author><pubDate>Thu, 11 Oct 2012 01:07:34 +0800</pubDate><description><![CDATA[本程序演示了如何捕捉和处理鼠标移动和拖拽事件。当鼠标在左边面板中移动或拖拽时，右边JTextArea会显示事件类型及当前光标坐标。

import java.awt.BorderLayout;
import java.awt.Color;
import java.awt.Container;
import java.awt.GridLayout;
import java.awt.event.M]]></description><category></category></item><item><title><![CDATA[[Java GUI] Swing中JList和JRadioButton的联合使用]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8053582</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8053582</guid><author>fduan</author><pubDate>Tue, 09 Oct 2012 19:09:48 +0800</pubDate><description><![CDATA[此例主要演示了JList和JRadioButton、ButtonGroup类的使用，用到的技巧主要是嵌套布局及匿名类。

import java.awt.BorderLayout;
import java.awt.Container;
import java.awt.GridLayout;
import java.awt.event.ItemEvent;
import java.awt.eve]]></description><category></category></item><item><title><![CDATA[[Java GUI] 一个功能极简的翻译软件]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8050625</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8050625</guid><author>fduan</author><pubDate>Tue, 09 Oct 2012 04:29:10 +0800</pubDate><description><![CDATA[主要用到的技巧包括界面嵌套布局（包括BorderLayout, FlowLayout, GridLayout），匿名类，以及java.util.Map泛型类的使用。Enjoy it !
import javax.swing.*;
import java.util.HashMap;
import java.util.Map;
import java.awt.BorderLayout;
import]]></description><category></category></item><item><title><![CDATA[[Java GUI] 从JTextArea中解析数字并求和]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8050411</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8050411</guid><author>fduan</author><pubDate>Mon, 08 Oct 2012 23:03:42 +0800</pubDate><description><![CDATA[从输入文本中自动解析各数字，并求和。单击save按钮，可将结果写入文件。
这里使用了嵌套布局方式设计界面。

import javax.swing.*;
import java.awt.BorderLayout;
import java.awt.Container;
import java.awt.event.*;
import java.io.BufferedWriter;
import]]></description><category></category></item><item><title><![CDATA[[Java GUI] 筛选指定区间内满足条件的数字]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/8050399</link><guid>https://blog.youkuaiyun.com/fduan/article/details/8050399</guid><author>fduan</author><pubDate>Mon, 08 Oct 2012 22:59:32 +0800</pubDate><description><![CDATA[嵌套布局的一个简单示例


import java.awt.BorderLayout;
import java.awt.Container;
import java.awt.GridLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import javax.swing.*;

cl]]></description><category></category></item><item><title><![CDATA[堆排序算法（C & Java 实现）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7837485</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7837485</guid><author>fduan</author><pubDate>Thu, 30 Aug 2012 11:05:30 +0800</pubDate><description><![CDATA[C语言版
#include 

#define SWAP( a, i, j ) { t = a[i]; a[i] = a[j]; a[j] = t; }
#define LESS( a, b )    ( a < b ) 

void disp_array( int a[], int n )
{
	int i;
	for( i = 0; i < n; ++i )
		printf( "%d ",]]></description><category></category></item><item><title><![CDATA[快速排序算法（C & Java 实现）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7914331</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7914331</guid><author>fduan</author><pubDate>Thu, 30 Aug 2012 07:28:27 +0800</pubDate><description><![CDATA[C语言版 
#include 

void disp_array( int a[], int n )
{
    int i;
    for( i = 0; i < n; ++i )
        printf( "%d ", a[i] );
    printf( "\n" );
}

int partition( int a[], int low, int high )
{
    in]]></description><category></category></item><item><title><![CDATA[简单选择排序（C & Java 实现）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7914327</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7914327</guid><author>fduan</author><pubDate>Thu, 30 Aug 2012 06:14:26 +0800</pubDate><description><![CDATA[C语言版 
#include 

#define SWAP( a, i, j ) { t = a[i]; a[i] = a[j]; a[j] = t; }

void disp_array( int a[], int n )
{
    int i;
    for( i = 0; i < n; ++i )    
        printf( "%d ", a[i] );]]></description><category></category></item><item><title><![CDATA[Do, or Do Not. There Is No “Try”.]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7914379</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7914379</guid><author>fduan</author><pubDate>Tue, 28 Aug 2012 05:42:07 +0800</pubDate><description><![CDATA[March 22, 2012 ·from www.yingyingz.com

I came across an article called “3 Words
 That Guarantee Failure“,and can’t agree with it more.

“I will try…”

It made me think of my old days of prepar]]></description><category></category></item><item><title><![CDATA[冒泡排序算法（C & Java 实现）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7914292</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7914292</guid><author>fduan</author><pubDate>Tue, 28 Aug 2012 00:58:18 +0800</pubDate><description><![CDATA[C语言版
#include 

#define SWAP( a, b ) { t = a; a = b; b = t; }
#define LESS( a, b ) a < b

void disp_array( int a[], int n );

void bubble_sort( int a[], int n )
{
    int i, j, t;
    int flag = 1; /]]></description><category></category></item><item><title><![CDATA[最小堆的实现（C 语言版）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7901358</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7901358</guid><author>fduan</author><pubDate>Thu, 23 Aug 2012 20:09:25 +0800</pubDate><description><![CDATA[最小堆本质上是一棵局部有序的完全二叉树，适于需要查找序列中前k小的元素的场合，如构造Huffman树。
核心算法为 向上调整（fix up）和向下调整（fix down）算法。
void fix_up_min_heap( int arr[], int n, int len, int i )
{
	int j = ( i - 1 ) / 2;	// parent index
	int tmp =]]></description><category></category></item><item><title><![CDATA[面试题解：二维数组中的查找（C 语言版）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7884295</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7884295</guid><author>fduan</author><pubDate>Sun, 19 Aug 2012 21:55:31 +0800</pubDate><description><![CDATA[题目描述：

在一个二维数组中，每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。
输入：
输入可能包含多个测试样例，对于每个测试案例，
输入的第一行为两个整数m和n(1
输入的第二行包括一个整数t(1
接下来的m行，每行有n个数，代表题目所给出的m行n列的矩阵(矩阵如题目描述所示，每一]]></description><category></category></item><item><title><![CDATA[由中序遍历序列和后序遍历序列构造二叉树（递归实现）]]></title><link>https://blog.youkuaiyun.com/fduan/article/details/7837467</link><guid>https://blog.youkuaiyun.com/fduan/article/details/7837467</guid><author>fduan</author><pubDate>Tue, 07 Aug 2012 06:41:44 +0800</pubDate><description><![CDATA[#include 
#include 

typedef struct bitree_node
{
    char data;
    struct bitree_node * lchild, * rchild;
}bitree_node, *binary_tree;


int locate_data( char arr[], int left, int right, char key )
{]]></description><category></category></item></channel></rss>