J2ME卡马克算法案例--地图滚屏(附源码)

本文介绍了一种封装方法,通过将复杂的过程封装进一个易于使用的类中来简化开发过程。这种方法有助于提高工作效率并减少重复劳动,使得开发者能够更加专注于核心业务逻辑。

版权申明:http://yarin.iteye.com/blog/453262

网上也有一些教程,也有很多解释,所以这里就不在介绍原理了,相信大家也都明白!

我这里只是将期封装成一个可以随便使用的类!~

只是为了我和大家的使用方便!

如果有什么问题请与我联系!谢谢支持!

效果如下:



 

import java.io.IOException; import javax.microedition.lcdui.Graphics; import javax.microedition.lcdui.Image; import javax.microedition.lcdui.game.GameCanvas; import javax.microedition.lcdui.game.LayerManager; import javax.microedition.lcdui.game.Sprite; import javax.microedition.lcdui.game.TiledLayer; public class WalkGameCanvas_18 extends GameCanvas implements Runnable{ private Graphics g; private Image i1,i2; private Sprite splayer; private LayerManager lm; private int [][]map; private int []right=new int[]{3,4,5}; private int []left=new int[]{9,10,11}; private int []up=new int[]{0,1,2}; private int []down=new int[]{6,7,8}; private TiledLayer t; private int viewX,y,x,viewY; private int keyState; private boolean rightFlag; private boolean leftFlag; private boolean upFlag; private boolean downFlag; WalkGameCanvas_18(){ super(true); g=this.getGraphics(); try{ i1=Image.createImage("/item01.png"); i2=Image.createImage("/walk.png"); }catch(IOException e){ e.printStackTrace(); } t=new TiledLayer(20,18,i1,16,16); map=new int[][]{ { 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 1, 2, 16, 17, 16, 17, 16, 17, 16, 17, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 6, 7, 11, 12, 11, 12, 3, 4, 5, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 16, 17, 16, 17, 16, 17, 8, 9, 10, 17, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 16, 17, 16, 17, 16, 17, 16, 17, 16, 17, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 16, 17, 16, 17, 16, 17, 13, 14, 15, 17, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 18, 19, 20, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 21, 21, 21, 22, 22, 21, 21, 17, 24, 25, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 21, 21, 23, 21, 21, 21, 21, 12, 11, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 26, 27, 28, 29, 30, 17, 16, 17, 16, 17, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 16, 17, 16, 17, 16, 17, 33, 34, 16, 17, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 35, 36, 11, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 16, 17, 16, 17, 16, 17, 16, 17, 16, 17, 16, 17, 16, 22, 16, 17 }, { 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12 }, { 16, 22, 16, 17, 16, 17, 16, 31, 32, 17, 16, 17, 16, 17, 16, 17, 16, 22, 16, 17 } }; for(int i=0;i<18;i++) for(int j=0;j<20;j++) t.setCell(j, i, map[i][j]); splayer=new Sprite(i2,i2.getWidth()/12,i2.getHeight()); lm=new LayerManager(); lm.append(splayer); lm.append(t); new Thread(this).start(); }
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值