C# (CSharp) LongestSubsequence.FindWord Beispiele

Beispiel #1

        public void FindWordTest(string characters, string result)
        {
            List <string> setOfWords = new List <string>()
            {
                "able",
                "ale",
                "apple",
                "bale",
                "kangaroo"
            };


            string expected = result;
            string actual   = LongestSubsequence.FindWord(characters, setOfWords);


            Assert.Equal(expected, actual);
        }