lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Csharp updates for 4, 9 chapters (#245)

Browse Source 
* GetGCDList fix

* Csharp longest_common_subsequence update

* Csharp levenshtein added

* Couple changes in levenshtein
This commit is contained in:
Alexandr
2023-07-19 21:49:54 +06:00
committed by GitHub
parent f53fe3b98a
commit ed5a723fa5
3 changed files with 127 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
04_quicksort/csharp/06_GetGCD/program.cs
View File

@@ -4,28 +4,37 @@ using System.Linq;
namespace GCD
{
public class program
public class Program
{
//Get great Comman Divisor
public static int GetGCD(int FirstNumber, int SecondNumber)
=> SecondNumber == default ? FirstNumber : GetGCD(SecondNumber, FirstNumber % SecondNumber);
//Get great Comman Divisor of list
public static int GetGCDList(List<int> lst)
{
var result = lst[0];
result = GetGCD(result, lst.Skip(1).FirstOrDefault());
return result;
}
static void Main(string[] args)
{
var lst = new List<int> { 32,696,40,50 };
var GCD = GetGCD( 640, 1680);
var lst = new List<int> { 32, 696, 40, 50 };
var GCD = GetGCD(640, 1680);
var GCDList = GetGCDList(lst);
Console.WriteLine(GCD);
Console.WriteLine(GCDList);
}
//Get great Comman Divisor
public static int GetGCD(int firstNumber, int secondNumber)
=> secondNumber == default ? firstNumber : GetGCD(secondNumber, firstNumber % secondNumber);
//Get great Comman Divisor of list
public static int GetGCDList(IEnumerable<int> lst)
{
var result = lst.FirstOrDefault();
if (lst.Count() > 2)
{
result = GetGCD(result, GetGCDList(lst.Skip(1)));
}
else
{
result = GetGCD(result, lst.Skip((1)).FirstOrDefault());
}
return result;
}
}
}