]]>
榪斿洖緇撴灉濡備笅錛?br />
瀹屾暣浠ｇ爜濡備笅錛?br />
#include <stdio.h>
//鏍戠粨鏋?/span>
typedef struct tree {
char data;
struct tree *lchild, *rchild;
} tree;
//鍒涘緩鏍?/span>
struct tree* create_tree() {
char node_data;
scanf("%c", &node_data);
if(node_data == '#') {
return NULL;
} else {
struct tree *T = NULL;
T = (struct tree*)malloc(sizeof(struct tree));
T->data = node_data;
T->lchild = create_tree();
T->rchild = create_tree();
return T;
}
}
//鍏堝簭閬嶅巻
void pre_traverse(struct tree *T) {
if(T == NULL) {
return;
} else {
printf("%c\t", T->data);
pre_traverse(T->lchild);
pre_traverse(T->rchild);
}
}
//涓簭閬嶅巻
void mid_traverse(struct tree *T) {
if(T == NULL) {
return;
} else {
mid_traverse(T->lchild);
printf("%c\t", T->data);
mid_traverse(T->rchild);
}
}
//鍚庡簭閬嶅巻
void aft_traverse(struct tree *T) {
if(T == NULL) {
return;
} else {
aft_traverse(T->lchild);
aft_traverse(T->rchild);
printf("%c\t", T->data);
}
}
//娣卞害
int tree_deepth(struct tree *T) {
int i,j;
if(!T) {
return 0;
} else {
if(T->lchild)
i = tree_deepth(T->lchild);
else
i = 0;
if(T->rchild)
j = tree_deepth(T->rchild);
else
j = 0;
return i > j ? (i + 1) : (j + 1);
}
}
int main(int argc, char **argv) {
struct tree *T = create_tree();
if(T) {
printf("%s\n", "鍏堝簭:");
pre_traverse(T);
printf("\n%s\n", "涓簭:");
mid_traverse(T);
printf("\n%s\n", "鍚庡簭:");
aft_traverse(T);
printf("\n%s\n", "娣卞害:");
int deepth = tree_deepth(T);
printf("%d\n", deepth);
printf("\n");
}
return 0;
}
//鏍戠粨鏋?/span>
typedef struct tree {
char data;
struct tree *lchild, *rchild;
} tree;
//鍒涘緩鏍?/span>
struct tree* create_tree() {
char node_data;
scanf("%c", &node_data);
if(node_data == '#') {
return NULL;
} else {
struct tree *T = NULL;
T = (struct tree*)malloc(sizeof(struct tree));
T->data = node_data;
T->lchild = create_tree();
T->rchild = create_tree();
return T;
}
}
//鍏堝簭閬嶅巻
void pre_traverse(struct tree *T) {
if(T == NULL) {
return;
} else {
printf("%c\t", T->data);
pre_traverse(T->lchild);
pre_traverse(T->rchild);
}
}
//涓簭閬嶅巻
void mid_traverse(struct tree *T) {
if(T == NULL) {
return;
} else {
mid_traverse(T->lchild);
printf("%c\t", T->data);
mid_traverse(T->rchild);
}
}
//鍚庡簭閬嶅巻
void aft_traverse(struct tree *T) {
if(T == NULL) {
return;
} else {
aft_traverse(T->lchild);
aft_traverse(T->rchild);
printf("%c\t", T->data);
}
}
//娣卞害
int tree_deepth(struct tree *T) {
int i,j;
if(!T) {
return 0;
} else {
if(T->lchild)
i = tree_deepth(T->lchild);
else
i = 0;
if(T->rchild)
j = tree_deepth(T->rchild);
else
j = 0;
return i > j ? (i + 1) : (j + 1);
}
}
int main(int argc, char **argv) {
struct tree *T = create_tree();
if(T) {
printf("%s\n", "鍏堝簭:");
pre_traverse(T);
printf("\n%s\n", "涓簭:");
mid_traverse(T);
printf("\n%s\n", "鍚庡簭:");
aft_traverse(T);
printf("\n%s\n", "娣卞害:");
int deepth = tree_deepth(T);
printf("%d\n", deepth);
printf("\n");
}
return 0;
}
]]>
鍩烘湰綆楁硶鎻忚堪濡備笅:
1銆佹瘡涓箍鍛婂鍔犳潈閲?br /> 2銆佸皢鎵鏈夊尮閰嶅箍鍛婄殑鏉冮噸鐩稿姞sum錛?br /> 3銆佷互鐩稿姞緇撴灉涓洪殢鏈烘暟鐨勭瀛愶紝鐢熸垚1~sum涔嬮棿鐨勯殢鏈烘暟rd
4銆?鎺ョ潃閬嶅巻鎵鏈夊箍鍛婏紝璁塊棶欏哄簭鍙互闅忔剰.灝嗗綋鍓嶈妭鐐圭殑鏉冮噸鍊煎姞涓婂墠闈㈣闂殑鍚勮妭鐐規潈閲嶅煎緱curWt,鍒ゆ柇curWt >= rd,濡傛灉鏉′歡鎴愮珛鍒欒繑鍥炲綋鍓嶈妭鐐?濡傛灉涓嶆槸鍒欑戶緇瘡鍔犱笅涓鑺傜偣. 鐩村埌絎﹀悎涓婇潰鐨勬潯浠?鐢變簬rd<=sum 鍥犳涓瀹氬瓨鍦╟urWt>=rd銆?br /> 鐗瑰埆璇存槑錛?br /> 姝ょ畻娉曞拰騫垮憡鐨勯『搴忔棤鍏?br />
嫻嬭瘯浠ｇ爜濡備笅錛?br />
import java.util.ArrayList;import java.util.Collections;import java.util.Comparator;import java.util.LinkedHashMap;import java.util.List;import java.util.Map;
public class Test {
/**
* @param args
*/ @SuppressWarnings("unchecked") public static void main(String[] args) { List<Node> arrNodes = new ArrayList<Node>(); Node n = new Node(10, "嫻嬭瘯1"); arrNodes.add(n); n = new Node(20, "嫻嬭瘯2"); arrNodes.add(n); n = new Node(30, "嫻嬭瘯3"); arrNodes.add(n); n = new Node(40, "嫻嬭瘯4"); arrNodes.add(n); //Collections.sort(arrNodes, new Node()); Map<String, Integer> showMap = null; int sum = getSum(arrNodes); int random = 0; Node kw = null; for(int k = 0; k < 20; k++) { showMap = new LinkedHashMap<String, Integer>(); for(int i = 0; i < 100; i++) { random = getRandom(sum); kw = getKW(arrNodes, random); if(showMap.containsKey(kw.kw)) { showMap.put(kw.kw, showMap.get(kw.kw) + 1); } else { showMap.put(kw.kw, 1); } //System.out.println(i + " " +random + " " + getKW(arrNodes, random)); } System.out.print(k + " "); System.out.println(showMap); } } public static Node getKW(List<Node> nodes, int rd) { Node ret = null; int curWt = 0; for(Node n : nodes){ curWt += n.weight; if(curWt >= rd) { ret = n; break; } } return ret; } public static int getSum(List<Node> nodes) { int sum = 0; for(Node n : nodes) sum += n.weight; return sum; } public static int getRandom(int seed) { return (int)Math.round(Math.random() * seed); }
}class Node implements Comparator{ int weight = 0; String kw = ""; public Node() {} public Node(int wt, String kw) { this.weight = wt; this.kw = kw; } public String toString(){ StringBuilder sbBuilder = new StringBuilder(); sbBuilder.append(" weight=").append(weight); sbBuilder.append(" kw").append(kw); return sbBuilder.toString(); } public int compare(Object o1, Object o2) { Node n1 = (Node)o1; Node n2 = (Node)o2; if(n1.weight > n2.weight) return 1; else return 0; }}]]>