Package g3201_3300.s3248_snake_in_matrix

Class Solution

java.lang.Object
g3201_3300.s3248_snake_in_matrix.Solution
public class Solution extends java.lang.Object
3248 - Snake in Matrix.

Easy

There is a snake in an n x n matrix grid and can move in four possible directions. Each cell in the grid is identified by the position: grid[i][j] = (i * n) + j.

The snake starts at cell 0 and follows a sequence of commands.

You are given an integer n representing the size of the grid and an array of strings commands where each command[i] is either "UP", "RIGHT", "DOWN", and "LEFT". It’s guaranteed that the snake will remain within the grid boundaries throughout its movement.

Return the position of the final cell where the snake ends up after executing commands.

Example 1:

Input: n = 2, commands = [“RIGHT”,“DOWN”]

Output: 3

Explanation:

image

Example 2:

Input: n = 3, commands = [“DOWN”,“RIGHT”,“UP”]

Output: 1

Explanation:

image

Constraints:

  • 2 <= n <= 10
  • 1 <= commands.length <= 100
  • commands consists only of "UP", "RIGHT", "DOWN", and "LEFT".
  • The input is generated such the snake will not move outside of the boundaries.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    finalPositionOfSnake(int n, java.util.List<java.lang.String> commands)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • finalPositionOfSnake

      public int finalPositionOfSnake(int n, java.util.List<java.lang.String> commands)