https://blog.youkuaiyun.com/lwwworkspacezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lwwworkspace/article/details/6697194https://blog.youkuaiyun.com/lwwworkspace/article/details/6697194lwwworkspaceThu, 18 Aug 2011 10:14:51 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/6054354https://blog.youkuaiyun.com/lwwworkspace/article/details/6054354lwwworkspaceSat, 04 Dec 2010 09:57:00 +0800首先我们要完成一个功能，在一个添加新用户的场景里，通过Radio按钮来判断用户选择的是管理员还是普通用户。
 
要使用Radio组的功能首先我们必须作如下设置：
 
1、2个Radio按钮的ID号不同，但是他们的tab顺序必须是按顺序排列的，这些都可以在Resource.h文件里面查看到。
      如：Radio1  ID：IDC_RADIO_ADMIN
            Radio2  ID：IDC_RADIO_USERhttps://blog.youkuaiyun.com/lwwworkspace/article/details/5925826https://blog.youkuaiyun.com/lwwworkspace/article/details/5925826lwwworkspaceThu, 07 Oct 2010 21:37:00 +0800HuffmanTree.h
 
#ifndef HUFFMANTREE #define OK 1 #define ERROR 0 typedef void* ElemType; typedef char** HuffmanCode; typedef struct HTNode { ElemType weight; unsigned int parent, lchild, rchild; }*HuffmanTree; int init_Huffman]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5902531https://blog.youkuaiyun.com/lwwworkspace/article/details/5902531lwwworkspaceThu, 23 Sep 2010 23:38:00 +0800 (y) ? (x) : (y) typedef void* ElemType; typedef struct CSNode { ElemType data; struct CSNode *first_child, *next_sibling; }*CSTree; int init_CSTree(CSTree); int mak]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5881966https://blog.youkuaiyun.com/lwwworkspace/article/details/5881966lwwworkspaceMon, 13 Sep 2010 22:14:00 +0800BiTree.h
 
#ifndef BITREE_H_H #define OK 1 #define ERROR 0 typedef char ElemType; typedef struct BiLNode { ElemType data; struct BiLNode *lchild; struct BiLNode *rchild; }BiTree; int init_BiTree(BiTree*); int make_node(BiLNode]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5869027https://blog.youkuaiyun.com/lwwworkspace/article/details/5869027lwwworkspaceTue, 07 Sep 2010 17:19:00 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/5855869https://blog.youkuaiyun.com/lwwworkspace/article/details/5855869lwwworkspaceWed, 01 Sep 2010 16:03:00 +0800CrossList.h
 
#ifndef CROSSLIST_H_H #define OK 1 #define ERROR 0 typedef int ElemType; typedef struct OLNode { ElemType data; int i, j; struct OLNode *right, *down; }OLNode; typedef struct { OLNode *rhead, *chead; int mu]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5816650https://blog.youkuaiyun.com/lwwworkspace/article/details/5816650lwwworkspaceMon, 16 Aug 2010 21:51:00 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/5813442https://blog.youkuaiyun.com/lwwworkspace/article/details/5813442lwwworkspaceSun, 15 Aug 2010 12:38:00 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/5807968https://blog.youkuaiyun.com/lwwworkspace/article/details/5807968lwwworkspaceThu, 12 Aug 2010 21:24:00 +0800KMP.H
 
#ifndef KMP_H_H #define OK 0 #define ERROR -1 #define MAX_LENGTH 255 typedef unsigned char SString[MAX_LENGTH + 1]; //第0个位置存放串的长度 int sstr_assign(SString, const char*); int sstr_print(SString); int print_nextval(SString, int*]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5804728https://blog.youkuaiyun.com/lwwworkspace/article/details/5804728lwwworkspaceWed, 11 Aug 2010 16:54:00 +0800SString.h
 
#ifndef SSTRING_H_H #define OK 0 #define ERROR -1 #define MAX_LENGTH 255 typedef unsigned char SString[MAX_LENGTH + 1]; //第0个位置存放串的长度 int sstr_assign(SString, const char*); int sstr_index(SString, SString, int); int sstr_]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5804388https://blog.youkuaiyun.com/lwwworkspace/article/details/5804388lwwworkspaceWed, 11 Aug 2010 15:31:00 +0800HString.h
 
#ifndef HSTRING_H_H #define OK 0 #define ERROR -1 typedef struct { char *ch; int length; }HString; int hstr_assign(HString*, const char*); int hstr_print(HString*); int hstr_length(HString*); int hstr_compare(HStrin]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5802598https://blog.youkuaiyun.com/lwwworkspace/article/details/5802598lwwworkspaceTue, 10 Aug 2010 21:55:00 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/5801767https://blog.youkuaiyun.com/lwwworkspace/article/details/5801767lwwworkspaceTue, 10 Aug 2010 16:03:00 +0800LinkQueue.h
 
#ifndef LINKQUEUE_H_H #define OK 0 #define ERROR -1 typedef int type; typedef struct QNode { type date; struct QNode *next; }QNode; typedef struct { QNode *front; QNode *rear; }LinkQueue; int init_linkQueue]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5799595https://blog.youkuaiyun.com/lwwworkspace/article/details/5799595lwwworkspaceMon, 09 Aug 2010 18:29:00 +0800CircularQueue.h
#ifndef SQQUEUE_H_H #define OK 0 #define ERROR -1 #define MAX_SIZE 5 typedef int type; typedef struct SNode { type date[MAX_SIZE]; int front; //队头指针 int rear; //对尾指针 int queue_length; int queue_size; }SqQueue]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/5799512https://blog.youkuaiyun.com/lwwworkspace/article/details/5799512lwwworkspaceMon, 09 Aug 2010 17:53:00 +0800SqQueue.h
#ifndef SQQUEUE_H_H #define OK 0 #define ERROR -1 #define MAX_SIZE 100 typedef int type; typedef struct SNode { type date[MAX_SIZE]; int front; //队头指针 int rear; //对尾指针 int queue_length; int queue_size; }SqQueue; ]]>https://blog.youkuaiyun.com/lwwworkspace/article/details/6502881https://blog.youkuaiyun.com/lwwworkspace/article/details/6502881lwwworkspaceSun, 08 Aug 2010 11:28:00 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/6502880https://blog.youkuaiyun.com/lwwworkspace/article/details/6502880lwwworkspaceSun, 08 Aug 2010 11:24:00 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/6502879https://blog.youkuaiyun.com/lwwworkspace/article/details/6502879lwwworkspaceSun, 08 Aug 2010 11:23:00 +0800https://blog.youkuaiyun.com/lwwworkspace/article/details/6502878https://blog.youkuaiyun.com/lwwworkspace/article/details/6502878lwwworkspaceSun, 08 Aug 2010 11:21:00 +0800