摘要:
35,15,+,80,70,-,*,20,///后缀表达方式(((35+15)*(80-70))/20)=25//中缀表达方式/,*,+,35,15,-,80,70,20//前缀表达方式人的思维方式很容易固定~~!正如习惯拉10进制。就对2,3,4,8,16等进制不知所措一样~~!人们习惯的运算方... 阅读全文
摘要:
class Teacher{ private String name; private Student student []; //多个学生用对象数组 public Teacher(String name) { this.name = name ; } public void setStudent(... 阅读全文
摘要:
String: 两个字符床 String stra 和String strb stra = "hello " ; strb = "hello " 在对象池中开辟一块内存"hello " stra与strb都指向同一块地址。 字符串的不可改变性 在JavaAPI文档... 阅读全文
摘要:
#define _CRT_SECURE_NO_WARNINGS#include#include#includeusing namespace std;#define MAX 20typedef struct node{ struct node * nextarc; char Info;}... 阅读全文
摘要:
#define _CRT_SECURE_NO_WARNINGS#include#include#define MAX 20typedef struct node{ struct node * nextarc; char Info;}ArcNode,*pArcNode;typedef st... 阅读全文
摘要:
Matrix.h#include"Matrix.h" #includeusing namespace std;Matrix::Matrix(int r = 0,int c = 0){ row = r; column = c;}Matrix Matrix::operator+ (co... 阅读全文
摘要:
#define _CRT_SECURE_NO_WARNINGS#include#include#include#define MAX 20#define INFINITY 0x7ffffffftypedef struct{ int U[MAX][MAX]; char adj[MAX][10]; in... 阅读全文
摘要:
#define _CRT_SECURE_NO_WARNINGS#include#include#include#includeusing namespace std;typedef struct node{ //哈夫曼树int weight;char data;int parent, lchild,... 阅读全文
摘要:
void traverse(pBitree root){ queueT; T.push(root); while (!T.empty()) { printf("%c", T.front()->data); if (T.front()->lchild!=NULL) T.push(T.front(... 阅读全文
摘要:
#define _CRT_SECURE_NO_WARNINGS#include#include#includeusing namespace std;typedef struct tree{ char data; tree *lchild; tree *rchild;}Bitree, *pBitre... 阅读全文