IT大道IT大道

首页 >  技术 > Leetcode: Design Snake Game

Leetcode: Design Snake Game

原文 http://www.cnblogs.com/EdwardLiu/p/6185503.html 2016-12-16 04:55:49 0 评论

Design a Snake game that is played on a device with screen size = width x height. Play the game online if you are not familiar with the game.

The snake is initially positioned at the top left corner (0,0) with length = 1 unit.

You are given a list of food's positions in row-column order. When a snake eats the food, its length and the game's score both increase by 1.

Each food appears one by one on the screen. For example, the second food will not appear until the first food was eaten by the snake.

When a food does appear on the screen, it is guaranteed that it will not appear on a block occupied by the snake.

Example:
Given width = 3, height = 2, and food = [[1,2],[0,1]].

Snake snake = new Snake(width, height, food);

Initially the snake appears at position (0,0) and the food at (1,2).

|S| | |
| | |F|

snake.move("R"); -> Returns 0

| |S| |
| | |F|

snake.move("D"); -> Returns 0

| | | |
| |S|F|

snake.move("R"); -> Returns 1 (Snake eats the first food and right after that, the second food appears at (0,1) )

| |F| |
| |S|S|

snake.move("U"); -> Returns 1

| |F|S|
| | |S|

snake.move("L"); -> Returns 2 (Snake eats the second food)

| |S|S|
| | |S|

snake.move("U"); -> Returns -1 (Game over because snake collides with border)

HashSet + Queue:

吃东西的时候保留尾巴,不吃的时候删去尾巴

one case to notice蛇转弯的时候,要先删去尾巴,再把新的点加进去。如果这个顺序不对的话,本来不会撞上尾巴的结果会判断会撞上

 1 public class SnakeGame {
 2     int m;
 3     int n;
 4     int[][] foods;
 5     Queue<Integer> queue;
 6     HashSet<Integer> set;
 7     int[] headPos;
 8     int foodSeq;
 9 
10 
11     /** Initialize your data structure here.
12         @param width - screen width
13         @param height - screen height 
14         @param food - A list of food positions
15         E.g food = [[1,1], [1,0]] means the first food is positioned at [1,1], the second is at [1,0]. */
16     public SnakeGame(int width, int height, int[][] food) {
17         this.m = height;
18         this.n = width;
19         this.foods = food;
20         this.queue = new LinkedList<Integer>();
21         this.set = new HashSet<Integer>();
22         this.headPos = new int[]{0, 0};
23         this.foodSeq = 0;
24         queue.offer(0);
25         set.add(0);
26     }
27     
28     /** Moves the snake.
29         @param direction - 'U' = Up, 'L' = Left, 'R' = Right, 'D' = Down 
30         @return The game's score after the move. Return -1 if game over. 
31         Game over when snake crosses the screen boundary or bites its body. */
32     public int move(String direction) {
33         int[] dir;
34         switch(direction) {
35             case "U": dir = new int[]{-1, 0}; break;
36             case "L": dir = new int[]{0, -1}; break;
37             case "R": dir = new int[]{0, 1}; break;
38             case "D": dir = new int[]{1, 0}; break;
39             default: dir = new int[2];
40         }
41         int row = headPos[0] + dir[0]; // new position row
42         int col = headPos[1] + dir[1]; // new position col
43         
44         //delete tail first, before push into a new cell
45         if (foodSeq<foods.length && calcPosId(foods[foodSeq][0], foods[foodSeq][1]) == calcPosId(row, col)) {
46             foodSeq++;
47         }
48         else {
49             set.remove(queue.poll());
50         }
51         
52         if (row<0 || row>=m || col<0 || col>=n) return -1; // hit border
53         if (set.contains(calcPosId(row, col))) return -1; // hit its own body
54         
55         set.add(calcPosId(row, col));
56         queue.offer(calcPosId(row, col));
57         headPos[0] = row;
58         headPos[1] = col;
59 
60         return set.size()-1;
61     }
62     
63     public int calcPosId(int x, int y) {
64         return x*n+y;
65     }
66 }
67 
68 /**
69  * Your SnakeGame object will be instantiated and called as such:
70  * SnakeGame obj = new SnakeGame(width, height, food);
71  * int param_1 = obj.move(direction);
72  */

Tags:Leetcode   Design   HashSet   Queue   Leetcode

标签列表