using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace SoloLearn { class Program { static void Main(string[] args) { var inputArray = new string[]{ "MANGOTZA", "YSEKSNNZ", "JSGMLWZA", "SXNGOOVP", "PWAWLHEP", "SWRJWNDL", "HNOLPAHE", "ANANABUI"}; var searchStrings = new string[]{"BANANA", "MANGO", "ORANGE", "APPLE", "WOW"}; var outMatrix = SearchWordRow(inputArray, searchStrings); Merge(outMatrix, SearchWordColumn(inputArray, searchStrings)); Merge(outMatrix, SearchWordDiagonal1(inputArray, searchStrings)); Merge(outMatrix, SearchWordDiagonal2(inputArray, searchStrings)); Print(inputArray, outMatrix); } private static void Merge(bool[][] mergeOutput, bool[][] mergeInput) { for(int i = 0; i < mergeInput.Length && i < mergeOutput.Length; i++) { for(int j = 0; j < mergeInput[i].Length && j < mergeOutput[i].Length; j++) { mergeOutput[i][j] |= mergeInput[i][j]; } } } private static void Print(string[] inputArray, bool[][] outMatrix) { Console.WriteLine("Input:"); foreach (var line in inputArray) { Console.WriteLine(line); } Console.WriteLine(); Console.WriteLine("Output (found search words):"); for(int j = 0; j < inputArray.Length; j++) { var printText = string.Empty; for(int i = 0; i < inputArray[j].Length; i++) { if (outMatrix[j][i]) { printText += inputArray[j][i]; } else { printText += " "; } } Console.WriteLine(printText); } } private static bool[][] SearchWordRow(string[] inputArray, string[] searchStrings) { var outMatrix = GetNewOutMatrix(inputArray); for(int inputIndex = 0; inputIndex < inputArray.Length; inputIndex++) { for(int searchWordIndex = 0; searchWordIndex < searchStrings.Count(); searchWordIndex++) { var inputText = inputArray[inputIndex]; var searchText = searchStrings[searchWordIndex]; SearchWordRowApply(outMatrix, inputIndex, inputText, searchText); char[] array = searchStrings[searchWordIndex].ToCharArray(); Array.Reverse(array); searchText = new string(array); SearchWordRowApply(outMatrix, inputIndex, inputText, searchText); } } return outMatrix.ToArray(); } private static void SearchWordRowApply(bool[][] outMatrix, int inputIndex, string inputText, string searchText) { var index = 0; while(true) { index = inputText.IndexOf(searchText, index); if (index < 0) { break; } else { for (int k = index; k < searchText.Length + index; k++) { outMatrix[inputIndex][k] = true; } } index++; } } private static bool[][] SearchWordColumn(string[] inputArray, string[] searchStrings) { var outMatrix = GetNewOutMatrix(inputArray); for(int inputIndex = 0; inputIndex < inputArray.Length; inputIndex++) { var input = new string(inputArray.Select(x => x[inputIndex]).ToArray()); for(int searchWordIndex = 0; searchWordIndex < searchStrings.Count(); searchWordIndex++) { var inputText = input; var searchText = searchStrings[searchWordIndex]; SearchWordColumnApply(outMatrix, inputIndex, inputText, searchText); char[] array = searchStrings[searchWordIndex].ToCharArray(); Array.Reverse(array); searchText = new string(array); SearchWordColumnApply(outMatrix, inputIndex, inputText, searchText); } } return outMatrix.ToArray(); } private static void SearchWordColumnApply(bool[][] outMatrix, int inputIndex, string inputText, string searchText) { var index = 0; while(true) { index = inputText.IndexOf(searchText, index); if (index < 0) { break; } else { for (int k = index; k < searchText.Length + index; k++) { outMatrix[k][inputIndex] = true; } } index++; } } private static bool[][] SearchWordDiagonal2(string[] inputArray, string[] searchStrings) { return Reverse2DArray(SearchWordDiagonal1(Reverse2DArray(inputArray), searchStrings)); } private static bool[][] SearchWordDiagonal1(string[] inputArray, string[] searchStrings) { var outMatrix = GetNewOutMatrix(inputArray); for (int inputIndex = -inputArray.Length; inputIndex < inputArray.First().Length; inputIndex++) { var input = string.Empty; for(int j = 0; j < Math.Min(inputArray.Length - inputIndex, inputArray.First().Length + inputIndex); j++) { if (inputIndex < 0) { input += inputArray[j-inputIndex][j]; } else { input += inputArray[j][j+inputIndex]; } } for(int searchWordIndex = 0; searchWordIndex < searchStrings.Count(); searchWordIndex++) { var inputText = input; var searchText = searchStrings[searchWordIndex]; SearchWordDiagonalApply(outMatrix, inputIndex, inputText, searchText); char[] array = searchStrings[searchWordIndex].ToCharArray(); Array.Reverse(array); searchText = new string(array); SearchWordDiagonalApply(outMatrix, inputIndex, inputText, searchText); } } return outMatrix.ToArray(); } private static void SearchWordDiagonalApply(bool[][] outMatrix, int inputIndex, string inputText, string searchText) { var index = 0; while(true) { index = inputText.IndexOf(searchText, index); if (index < 0) { break; } else { for (int k = index; k < searchText.Length + index; k++) { if (inputIndex < 0) { outMatrix[k-inputIndex][k] = true; } else { outMatrix[k][k+inputIndex] = true; } } } index++; } } private static bool[][] GetNewOutMatrix(IEnumerable searchMap) { var outMatrix = new List(); foreach(var item in searchMap) { bool[] array = item.Select(x => false).ToArray(); outMatrix.Add(array); } return outMatrix.ToArray(); } private static bool[][] Reverse2DArray(bool[][] input) { var output = new List(); foreach(var item in input) { var reverseItem = item.ToArray(); Array.Reverse(reverseItem); output.Add(reverseItem); } return output.ToArray(); } private static string[] Reverse2DArray(string[] input) { var output = new List(); foreach(var item in input) { char[] array = item.ToCharArray(); Array.Reverse(array); var reverseText = new string(array); output.Add(reverseText); } return output.ToArray(); } } }

(Challange) Crossword Solver