问答题

【说明】
下面是一个Applet程序,其功能是通过一个按钮控制一个窗口的创建,显示与隐藏,并且以按钮文字作为提示,可以随着窗口的状态改变,即如果窗口出现,则按钮文字为"Hide myFrm",提示用户点击按钮,则隐藏窗口,反之亦然。请将横线处语句补充完整。
程序运行结果如图5所示:


import java. awt. *;
import java. applet. *;
<applet code =" ex8_7. class" width =800 height =400 >
</applet >
*/
public class ex8_7 extends Applet
private Frame frm;
private Button showBtn;
public void init()
showBtn = new Button("Show Frame");
(1) ;
public boolean action( Event e, Object o )
if( e. target = = showBtn )
if( (2) )
(3) ;
frm. dispose()
(4)
showBtn, setLabel("Show myFrm");

else
frm = new Frame( "myFrm" );
frm. resize( 200, 150 );
frm. setBackground( Color. gray );
(5) ;
showBtn, setLabel (" Hide myFrm" );

return true;
ex8_7, html
< HTML >
< HEAD >
<TITLE > ex8_7 </TITLE >
</HEAD >
< BODY >
<appletcode =" ex8_7, class" width=800 height=400 >
</applet >
</BODY >
</HTML >

【参考答案】

(1)add( showBtn ) (2)fml !=null (3)frm. show()
(4)f......

(↓↓↓ 点击下方‘点击查看答案’看完整答案、解析 ↓↓↓)
热门 试题

问答题
【程序说明】 本程序先从文件读人各考生的准考证号(设为整型数)及成绩,并将其存放在一棵检索二叉树上,二叉树结点的健值是成绩,每个结点带一链表,链表结点存放取得该成绩的考生的准考证号。然后,程序按中序遍历检索二叉树,从高分到低分输出结果,使每行输出成绩及其取得成绩的考生的准考证号。 【程序】 #include < stdio. h > typedef struet idnode int id; struct idnode * next; ldNode; typedef struct marknode I int mark; ldNode * head; struct marknode * left, * right; MarkNode; char fname [ ] = sp07.dat ; main( ) int id, mark; MarkNode * root = null; FILE * fp = fopen(fname, r ); if(!fp) printf( file%s open error, n , fname); exit(0); while (!feop(fp)) fscanf(fp, %d%d , &id, &mark); btree(&root, id, mark); fclose(fp); print(root); btree(MarkNod * * mpptr, int id, int mark) ldNode * ip; MarkNode *mp = * mpptr; if (1) if (mark==p->mark) addldNODE ( (2) , id); else if ( mark >mp -> mark) btree (&top -> left, id, mark); else btree(&mp-> right, id, mark); else Imp = ( marknode * ) malloc(sizeo (marknode) ); mp -> mark = mark; mp -> left =mp -> right = NULL; (3) addldNode(&mp -> head, id); (4) ; addldNode(ldNode * * ipp, int id) ldNode * ip = * ipp; if ( (5) )addldNode ( (6) ), id; else ip = (ldNode * )malloc(sizeof(ldNode) ); sp - > id = id; ip -> next = NULL; (7) print(MarkNode * rap) ldNode *ip, *ip0; if (mp) print ( mp -> left); printf( %6d: t ,mp -> mark); ip = mp -> head; while(ip) printf( %6d ,ip -> id); ip0 =ip; ip = ip -> next; free (ip0); printf( n ); printf( mp -> right); free(mp);