赞
踩
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)
State the problem (as you understand it):
Solve examples that are big enough and are normal cases (manually to figure out the general solution):
Ask clarification questions:
State assumptions:
Consider several test cases (edge cases, base cases):
See if a Data Structure fits the problem:
See if an Algorithm fits the problem:
Extract the core problem:
Try breaking it down into subproblems:
Explain Potential Solutions (see solutin section):
Other solutions:
Compare solutions:
Follow Up (TODO):
Solution 1:
Ideas:
Steps:
Validate the correctness (of your pseudocode with a test case):
Data Structure:
Time Complexity:
Space Complexity:
- class SnakeGame {
-
- private int width;
- private int height;
-
- private int[][] food;
- private int foodIndex = 0;
-
- private int score = 0;
- private Deque<Position> snake = new ArrayDeque<>();
-
- /** Initialize your data structure here.
- @param width - screen width
- @param height - screen height
- @param food - A list of food positions
- E.g food = [[1,1], [1,0]] means the first food is positioned at [1,1], the second is at [1,0]. */
- public SnakeGame(int width, int height, int[][] food) {
- this.width = width;
- this.height = height;
-
- this.food = food;
- this.snake.offerFirst(new Position(0, 0));
- }
-
- /** Moves the snake.
- @param direction - 'U' = Up, 'L' = Left, 'R' = Right, 'D' = Down
- @return The game's score after the move. Return -1 if game over.
- Game over when snake crosses the screen boundary or bites its body. */
- public int move(String direction) {
- if (this.score == -1) {
- return -1;
- }
-
- Position head = this.snake.peekFirst();
- Position newHead = new Position(head.x, head.y);
-
- switch (direction) {
- case "U":
- newHead.x--;
- break;
- case "D":
- newHead.x++;
- break;
- case "L":
- newHead.y--;
- break;
- default:
- newHead.y++;
- break;
- }
-
- if (newHead.x < 0 || newHead.x == this.height || newHead.y < 0 || newHead.y == this.width) {
- return score = -1;
- }
-
- Position tail = this.snake.pollLast();
- if (this.snake.contains(newHead)) {
- return score = -1;
- }
- this.snake.offerFirst(newHead);
-
- if (this.foodIndex < this.food.length && this.food[this.foodIndex][0] == newHead.x
- && this.food[this.foodIndex][1] == newHead.y) {
- this.snake.addLast(tail);
- this.foodIndex++;
- this.score++;
- }
-
- return this.score;
- }
-
- private class Position {
- private int x;
- private int y;
-
- public Position(int x, int y) {
- this.x = x;
- this.y = y;
- }
-
- @Override
- public boolean equals(Object other) {
- if (this == other) {
- return true;
- }
- if (other == null || this.getClass() != other.getClass()) {
- return false;
- }
-
- Position otherPosition = (Position) other;
- return this.x == otherPosition.x && this.y == otherPosition.y;
- }
- }
- }
-
- /**
- * Your SnakeGame object will be instantiated and called as such:
- * SnakeGame obj = new SnakeGame(width, height, food);
- * int param_1 = obj.move(direction);
- */
Test your code again to make sure you don't have any bugs.
Solution 2:
Ideas:
Steps:
Validate the correctness (of your pseudocode with a test case):
Data Structure:
Time Complexity:
Space Complexity:
- class SnakeGame {
-
- private int width;
- private int height;
-
- private int[][] food;
- private int foodIndex = 0;
-
- private int score = 0;
- private Set<Position> snake = new LinkedHashSet<>();
- private Position snakeHead;
-
- /** Initialize your data structure here.
- @param width - screen width
- @param height - screen height
- @param food - A list of food positions
- E.g food = [[1,1], [1,0]] means the first food is positioned at [1,1], the second is at [1,0]. */
- public SnakeGame(int width, int height, int[][] food) {
- this.width = width;
- this.height = height;
-
- this.food = food;
- this.snakeHead = new Position(0, 0);
- this.snake.add(this.snakeHead);
- }
-
- /** Moves the snake.
- @param direction - 'U' = Up, 'L' = Left, 'R' = Right, 'D' = Down
- @return The game's score after the move. Return -1 if game over.
- Game over when snake crosses the screen boundary or bites its body. */
- public int move(String direction) {
- if (this.score == -1) {
- return -1;
- }
-
- Position newHead = new Position(snakeHead.x, snakeHead.y);
-
- switch (direction) {
- case "U":
- newHead.x--;
- break;
- case "D":
- newHead.x++;
- break;
- case "L":
- newHead.y--;
- break;
- default:
- newHead.y++;
- break;
- }
-
- if (newHead.x < 0 || newHead.x == this.height || newHead.y < 0 || newHead.y == this.width) {
- return score = -1;
- }
-
- Iterator<Position> iter = snake.iterator();
- Position tail = iter.next();
- if (!newHead.equals(tail) && this.snake.contains(newHead)) {
- return score = -1;
- }
- if (this.foodIndex < this.food.length && this.food[this.foodIndex][0] == newHead.x
- && this.food[this.foodIndex][1] == newHead.y) {
- this.foodIndex++;
- this.score++;
- } else {
- iter.remove();
- }
-
- this.snake.add(newHead);
- this.snakeHead = newHead;
- return this.score;
- }
-
- private class Position {
- private int x;
- private int y;
-
- public Position(int x, int y) {
- this.x = x;
- this.y = y;
- }
-
- @Override
- public boolean equals(Object other) {
- if (this == other) {
- return true;
- }
- if (other == null || this.getClass() != other.getClass()) {
- return false;
- }
-
- Position otherPosition = (Position) other;
- return this.x == otherPosition.x && this.y == otherPosition.y;
- }
-
- @Override
- public int hashCode() {
- return Objects.hash(this.x, this.y);
- }
- }
- }
-
- /**
- * Your SnakeGame object will be instantiated and called as such:
- * SnakeGame obj = new SnakeGame(width, height, food);
- * int param_1 = obj.move(direction);
- */
Test your code again to make sure you don't have any bugs.
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。