摘要:
#include#include#include#include#include"printBinaryTreeInLevel.h"#include#include#include#include#includeusing namespace std;int n=0;int turn;int instrest[2];void thread1(){ /*while(true) // 软件方法实现临界区的代码 { turn=0; instrest[0]=1; while(turn==0&&instrest[1]==1); cout<<"th 阅读全文
posted @ 2013-07-05 17:18
dyc0113
阅读(731)
评论(0)
推荐(0)

浙公网安备 33010602011771号