/
alozar
/
LeetCode
Обзор
Документация
Войти
/
alozar
/
LeetCode
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
LeetCode.Tests/Problems/Problems433_Tests.cs
47 строк
1 KB
alozar
Создан проект для агрегации задач из LeetCode. Добавлены задачи 20, 200, 279, 433, 448, 739, 752.
28 янв 2025, 20:33
28 янв 2025, 20:33
a703a31
Код
Авторство
О чём код?
using LeetCode.Problems; using Xunit; namespace LeetCode.Tests.Problems; public class Problems433_Tests { public static IEnumerable<object[]> GetTestData() { List<object[]> data = []; string startGene = "AACCGGTT"; string endGene = "AACCGGTA"; string[] bank = ["AACCGGTA"]; int expected = 1; data.Add([startGene, endGene, bank, expected]); startGene = "AACCGGTT"; endGene = "AAACGGTA"; bank = ["AACCGGTA", "AACCGCTA", "AAACGGTA"]; expected = 2; data.Add([startGene, endGene, bank, expected]); startGene = "AACCGGTT"; endGene = "AAACGGTA"; bank = []; expected = -1; data.Add([startGene, endGene, bank, expected]); startGene = "AAAAAAAA"; endGene = "CCCCCCCC"; bank = ["AAAAAAAA", "AAAAAAAC", "AAAAAACC", "AAAAACCC", "AAAACCCC", "AACACCCC", "ACCACCCC", "ACCCCCCC", "CCCCCCCA"]; expected = -1; data.Add([startGene, endGene, bank, expected]); return data; } [Theory] [MemberData(nameof(GetTestData))] public void Test_Success(string startGene, string endGene, string[] bank, int expected) { int result = Problems433.MinMutation(startGene, endGene, bank); Assert.Equal(expected, result); } }