代码搜索:字符编码
找到约 10,000 项符合「字符编码」的源代码
代码结果 10,000
www.eeworm.com/read/125170/14511184
cpp 哈夫曼编码.cpp
#include "malloc.h"
#include "string.h"
#include "stdio.h"
#define MAX 1.0
typedef struct{
double weight;
int parent,lchild,rchild;
bool use;
}HTNode,*Huffmantree;
void Select(Huffmantre
www.eeworm.com/read/123850/14609568
txt java 程序编码规范.txt
作者:zergman
email: zergman@chinaasp.com
日期:2001-6-15 13:24:42
[BLOCKQUOTE][BLOCKQUOTE][BLOCKQUOTE][BLOCKQUOTE][BLOCKQUOTE][BLOCKQUOTE]
[b]Java 程序编码规范[/b]
[b][/b][/BLOCKQUOTE][/BLOCKQUOTE][/BLOCKQU
www.eeworm.com/read/122615/14678885
cpp 赫夫曼编码器.cpp
# include
# include
# include
# include
# include
# define MAX_LENGTH 100
typedef char **HuffmanCode;
typedef struct
{ int weight
www.eeworm.com/read/222259/14699225
cpp 哈夫曼编码.cpp
#include "stdio.h"
#include "iostream.h"
#include
#include
#define NULL 0
#define MAX 100
#define LEN sizeof (struct HuffmanTree)
struct HuffmanTree{
char data;
struc
www.eeworm.com/read/120892/14784261
cpp 哈夫曼编码.cpp
#include
#include
#include
#include
#define NUM 8;
typedef struct
{ unsigned int weight;
unsigned int parent,lchild,rchild;
unsigned char data;
www.eeworm.com/read/218229/14930473
exe 哈夫曼编码.exe
www.eeworm.com/read/218229/14930477
cpp 哈夫曼编码.cpp
#include
#include "creat.h"
main()
{
int m=0,n,i,j,k=0;
huffnode ht[2*Maxsize];
huffcode hcd[Maxsize];
char choice;
cout