using System; public class Solution { public int[] solution(string[] park, string[] routes) { int[] answer = new int[2]; int[] startPos = new int[2]; bool[,] canGo = new bool[park.Length, park[0].Length]; bool allCanGo = true; for(int i = 0; i < park.Length; ++i) { for(int j = 0; j < park[0].Length; ++j) { if(park[i][j] == 'S') { startPos[1] = j; startPos[0] = i; canGo[i,j] = true; continue; } e..