VAR/AdventOfCode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Code cleanup

Browse Source
This commit is contained in:
Valeriano A.R.
2023-12-02 18:27:00 +01:00
parent 4d8bfbb377
commit 4b3d0fd0b6
78 changed files with 6814 additions and 6950 deletions
Download Patch File Download Diff File Expand all files Collapse all files

133
AdventOfCode2020/Day09.cs
View File

@@ -91,83 +91,82 @@ What is the encryption weakness in your XMAS-encrypted list of numbers?
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day09 : IDay
{
public class Day09 : IDay
public string ResolvePart1(string[] inputs)
{
public string ResolvePart1(string[] inputs)
int preamble = 25;
if (inputs.Length < preamble) { preamble = 5; }
List<long> numbers = inputs.Select(x => Convert.ToInt64(x)).ToList();
int firstInvalid = XMAS_FindFirstInvalid(preamble, numbers);
return numbers[firstInvalid].ToString();
}
public string ResolvePart2(string[] inputs)
{
int preamble = 25;
if (inputs.Length < preamble) { preamble = 5; }
List<long> numbers = inputs.Select(x => Convert.ToInt64(x)).ToList();
int firstInvalid = XMAS_FindFirstInvalid(preamble, numbers);
long numberInvalid = numbers[firstInvalid];
long numberChecksum = -1;
bool found = false;
for (int i = firstInvalid - 1; i > 0 && found == false; i--)
{
int preamble = 25;
if (inputs.Length < preamble) { preamble = 5; }
List<long> numbers = inputs.Select(x => Convert.ToInt64(x)).ToList();
int firstInvalid = XMAS_FindFirstInvalid(preamble, numbers);
return numbers[firstInvalid].ToString();
}
public string ResolvePart2(string[] inputs)
{
int preamble = 25;
if (inputs.Length < preamble) { preamble = 5; }
List<long> numbers = inputs.Select(x => Convert.ToInt64(x)).ToList();
int firstInvalid = XMAS_FindFirstInvalid(preamble, numbers);
long numberInvalid = numbers[firstInvalid];
long numberChecksum = -1;
bool found = false;
for (int i = firstInvalid - 1; i > 0 && found == false; i--)
long sum = numbers[i];
long max = numbers[i];
long min = numbers[i];
for (int j = (i - 1); j >= 0 && found == false; j--)
{
long sum = numbers[i];
long max = numbers[i];
long min = numbers[i];
for (int j = (i - 1); j >= 0 && found == false; j--)
sum += numbers[j];
if (numbers[j] > max) { max = numbers[j]; }
if (numbers[j] < min) { min = numbers[j]; }
if (sum == numberInvalid)
{
sum += numbers[j];
if (numbers[j] > max) { max = numbers[j]; }
if (numbers[j] < min) { min = numbers[j]; }
if (sum == numberInvalid)
{
found = true;
numberChecksum = max + min;
}
if (sum > numberInvalid)
{
break;
}
found = true;
numberChecksum = max + min;
}
}
return numberChecksum.ToString();
}
private static int XMAS_FindFirstInvalid(int preamble, List<long> numbers)
{
int firstInvalid = -1;
for (int i = preamble; i < numbers.Count; i++)
{
bool valid = false;
long number = numbers[i];
for (int j = (i - preamble); j < (i - 1) && valid == false; j++)
if (sum > numberInvalid)
{
for (int k = (j + 1); k < i && valid == false; k++)
{
long sum = numbers[j] + numbers[k];
if (sum == number)
{
valid = true;
}
}
}
if (valid == false)
{
firstInvalid = i;
break;
}
}
return firstInvalid;
}
return numberChecksum.ToString();
}
}
private static int XMAS_FindFirstInvalid(int preamble, List<long> numbers)
{
int firstInvalid = -1;
for (int i = preamble; i < numbers.Count; i++)
{
bool valid = false;
long number = numbers[i];
for (int j = (i - preamble); j < (i - 1) && valid == false; j++)
{
for (int k = (j + 1); k < i && valid == false; k++)
{
long sum = numbers[j] + numbers[k];
if (sum == number)
{
valid = true;
}
}
}
if (valid == false)
{
firstInvalid = i;
break;
}
}
return firstInvalid;
}
}