座席制

コード2020日11の出現

シミュレータを試してください

タスク：Xのどこに解決する.

X = the number of seats occupied once seat occupation no longer changes

例入力

L.LL.LL.LL
LLLLLLL.LL
L.L.L..L..
LLLL.LL.LL
L.LL.LL.LL
L.LLLLL.LL
..L.L.....
LLLLLLLLLL
L.LLLLLL.L
L.LLLLL.LL

第1部

このパズルタイプ再び？

どのようにこのパズルを比較するのですか？

アルゴリズムの記述

Process the input into an array of arrays:
  Split the input at each new line character into an array of strings
  Split each string into an array of characters

Create an array of 8 pairs that represent the coordinates of each cell's adjacent cells

Turn an array like this:
L.L
.L.
L.L

Into an array like this:
.....
.L.L.
..L..
.L.L.
.....

Do at least one time, then again only if an array of cells to switch is not empty:
  Empty the array of cells
  For each cell in the grid of seats, except for the bordering cells:
    Check each adjacent cell and accumulate tallies for each of the three possible characters found: . # L
    If the current cell contains an 'L' and the number of '#'s found is 0
      Add the cell's coordinates to the list of switchers with an instruction to change it's value to '#'
    Else, if the current cell contains an '#' and the number of '#'s found is 4 or more
      Add the cell's coordinates to the list of switchers with an instruction to change it's value to 'L'

For each coordinate and instruction set in the list of switchers
  Update the cell in the grid of seats at the current location to the value specified

For each nested array in the grid of seats
  Accumulate a sum - starting at 0 - of the count of '#' characters in each array

Return the sum

ビルドシミュレータ

第2部

楽しいツイスト！

.....
.!!!.
.!S!.
.!!!.
.....

!.!.!
.!!!.
!!S!!
.!!!.
!.!.!

新しく必要なサブルーチンを書く

関数: isatavalidLocation ()

Expects two parameters
  1. Row index
  2. Column index

Return false, unless:
  Both indices are greater than or equal to 0
  And Row is less than the length of the number of arrays in the outer-most array
  And Column is less than the length of any nested array (they are all the same length)

関数: firstvisiblate ()

Expects two parameters
  1. A pair of coordinates representing the direction to travel from an origin point
  2. A pair of coordinates representing the originating row and column indices

Return '.' to indicate 'No seat found', unless:
  The next cell along the path 'isAtAValidLocation'
  If the next cell is at a valid location
    And its value is '.'
      Continue along the path
    Else - its value is not '.'
      Return its value - being either 'L' or '#' 

作業アルゴリズムの更新

Do at least one time, then again only if an array of cells to switch is not empty:
  Empty the array of cells
  For each cell in the grid of seats:
    Continue along a straight line - starting from each adjacent cell and continuing until either a seat is found or reaching the boundary of the room - and accumulate tallies for each of the three possible characters found: . # L
    If the current cell contains an 'L' and the number of '#'s found is 0
      Add the cell's coordinates to the list of switchers with an instruction to change it's value to '#'
    Else, if the current cell contains an '#' and the number of '#'s found is 5 or more
      Add the cell's coordinates to the list of switchers with an instruction to change it's value to 'L'

For each coordinate and instruction set in the list of switchers
  Update the cell in the grid of seats at the current location to the value specified

シミュレータの更新