坦克大战程序代码

  • 格式:docx
  • 大小:194.06 KB
  • 文档页数:46

坦克大战程序代码

This model paper was revised by the Standardization Office on December 10, 2020 class f extends JFrame {

f(String title) {

(title) ;

(608 , 630) ;

(300 , 100) ;

;

MyTank mp = new MyTank() ;

(mp) ;

(mp) ;

new Thread(mp).start() ;

}

public static void main(String[] args) {

f h = new f("坦克大战(版本") ;

(true) ;

}

} //主战坦克

class MyTank extends JPanel implements KeyListener , Runnable {

int x = 280, y = 280 ;//坦克的初始位置

int op = 1 ;//坦克的移动方向

int color = 0 ;

int tankspeed = 8 ;//坦克的速度

int tankbullet = 8 ;//坦克的子弹速度

int tankfbullet = 4 ;//敌军的子弹速度

int shengming = 100 ;//生命

int fenshu = 0 ;

int nandu = 5 ; //设置游戏难度

//子弹

int dx = 295 , dy = 295 ;

int dx1 = 295 , dy1 = -10 ;

int dx2 = 600 , dy2 = 295 ;

int dx3 = 295 , dy3 = 600 ; int dx4 = -10 , dy4 = 295 ;

//敌军坦克

int num = 10 ;//敌军坦克数量,不能修改

int[] xf = new int[num] ;

int[] yf = new int[num] ;

int[] opf = new int[num] ;

int[] dxf = new int[num] ;

int[] dyf = new int[num] ;

int[] dxf1 = new int[num] ;

int[] dyf1 = new int[num] ;

int[] dxf2 = new int[num] ;

int[] dyf2 = new int[num] ;

int[] dxf3 = new int[num] ;

int[] dyf3 = new int[num] ;

int[] dxf4 = new int[num] ;

int[] dyf4 = new int[num] ; //构造函数,初始化敌军坦克的位置和状态

MyTank() {

for (int i = 0; i

xf[i] = (int) () * 560) ;

yf[i] = (int) () * 560) ;

dxf[i] = xf[i] + 15 ;

dyf[i] = yf[i] + 15 ;

}

for (int i = 0; i

dxf1[i] = 295 ; dyf1[i] = -10 ;

dxf2[i] = 600 ; dyf2[i] = 295 ;

dxf3[i] = 295 ; dyf3[i] = 600 ;

dxf4[i] = -10 ; dyf4[i] = 295 ;

}

}

//主面版 public void paint(Graphics g) {

(g) ;

;

;

("生命:" , 10 , 20 ) ;

(50 , 10 , shengming * 5 , 10) ;

(50 , 10 , 500 , 10) ;

("得分: "+ fenshu , 10 , 40) ;

if(op == 1) {

;

(x , y , 40 , 40) ;

switch (color % 6) {

case 0: ; break;

case 1: ; break;

case 2: ; break;

case 3: ; break; case 4: ; break;

case 5: ; break;

}

(x - 5 , y - 5 , 10 , 10) ;

(x - 5 , y + 5 , 10 , 10) ;

(x - 5 , y + 15 , 10 , 10) ;

(x - 5 , y + 25 , 10 , 10) ;

(x - 5 , y + 35 , 10 , 10) ;

(x + 35 , y - 5 , 10 , 10) ;

(x + 35 , y + 5 , 10 , 10) ;

(x + 35 , y + 15 , 10 , 10) ;

(x + 35 , y + 25 , 10 , 10) ;

(x + 35 , y + 35 , 10 , 10) ;

;

(x + 15 , y - 20 , 10 , 40) ;

switch (color % 20) { case 0: ; break;

case 1: ; break;

case 2: ; break;

case 3: ; break;

case 4: ; break;

case 5: ; break;

case 6: ; break;

case 7: ; break;

case 8: ; break;

case 9: ; break;

case 10: ; break;

case 11: ; break;

case 12: ; break;

case 13: ; break;

case 14: ; break;

case 15: ; break; case 16: ; break;

case 17: ; break;

case 18: ; break;

case 19: ; break;

}

(x + 5 , y + 30 , 10 , 10) ;

(x + 25 , y + 30 , 10 , 10) ;

}

if(op == 2) {

;

(x , y , 40 , 40) ;

switch (color % 6) {

case 0: ; break;

case 1: ; break;

case 2: ; break;

case 3: ; break; case 4: ; break;

case 5: ; break;

}

(x - 5 , y - 5 , 10 , 10) ;

(x + 5 , y - 5 , 10 , 10) ;

(x + 15 , y - 5 , 10 , 10) ;

(x + 25 , y - 5 , 10 , 10) ;

(x + 35 , y - 5 , 10 , 10) ;

(x - 5 , y+35 , 10 , 10) ;

(x + 5 , y+35 , 10 , 10) ;

(x + 15 , y+35 , 10 , 10) ;

(x + 25 , y+35 , 10 , 10) ;

(x + 35 , y+35 , 10 , 10) ;

;

(x + 20 , y + 15 , 40 , 10) ;

switch (color % 20) { case 0: ; break;

case 1: ; break;

case 2: ; break;

case 3: ; break;

case 4: ; break;

case 5: ; break;

case 6: ; break;

case 7: ; break;

case 8: ; break;

case 9: ; break;

case 10: ; break;

case 11: ; break;

case 12: ; break;

case 13: ; break;

case 14: ; break;

case 15: ; break; case 16: ; break;

case 17: ; break;

case 18: ; break;

case 19: ; break;

}

(x , y + 5 , 10 , 10) ;

(x , y + 25 , 10 , 10) ;

}

if(op == 3) {

;

(x , y , 40 , 40) ;

switch (color % 6) {

case 0: ; break;

case 1: ; break;

case 2: ; break;

case 3: ; break;