advent-of-code/2022
1
0
Fork 0
mirror of https://github.com/parnic/advent-of-code-2022.git synced 2025-06-16 13:40:13 -05:00
Code Issues Packages Projects Releases Wiki Activity

Reformat code, remove unnecessary function

Browse Source
This commit is contained in:
Chris Pickett
2022-12-21 13:27:12 -06:00
parent bb68e1d944
commit aba8631366
2 changed files with 13 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/20.cs
View File

@ -2,28 +2,12 @@
internal class Day20 : Day internal class Day20 : Day
{ {
private List<(int num, int origIdx)> nums = new(); private readonly List<(long num, int origIdx)> nums = new();
internal override void Parse() internal override void Parse()
{ {
foreach (var line in Util.Parsing.ReadAllLines("20")) foreach (var line in Util.Parsing.ReadAllLines("20"))
{ {
nums.Add((int.Parse(line), nums.Count)); nums.Add((long.Parse(line), nums.Count));
}
}
private static void mix(List<(int num, int origIdx)> mixedNums, IList<(int num, int origIdx)> origNums)
{
for (int i = 0; i < origNums.Count; i++)
{
if (origNums[i].num == 0)
{
continue;
}
var idx = mixedNums.FindIndex(n => n.origIdx == origNums[i].origIdx);
mixedNums.RemoveAt(idx);
var newIdx = Util.Math.Modulo(idx + origNums[i].num, mixedNums.Count);
mixedNums.Insert((int)newIdx, origNums[i]);
} }
} }
@ -45,7 +29,7 @@ internal class Day20 : Day
internal override string Part1() internal override string Part1()
{ {
var mixedNums = new List<(int num, int origIdx)>(nums); var mixedNums = new List<(long num, int origIdx)>(nums);
mix(mixedNums, nums); mix(mixedNums, nums);
var zeroIdx = mixedNums.FindIndex(n => n.num == 0); var zeroIdx = mixedNums.FindIndex(n => n.num == 0);

14
src/Util/Math.cs
View File

@ -44,18 +44,24 @@ public static class Math
return (a * b) / GCD(a, b); return (a * b) / GCD(a, b);
} }
public static long Modulo(long numer, long denom) { public static long Modulo(long numer, long denom)
{
// long q = numer / denom; // long q = numer / denom;
long r = numer % denom; long r = numer % denom;
if (r < 0) { if (r < 0)
if (denom > 0) { {
if (denom > 0)
{
// q = q - 1; // q = q - 1;
r = r + denom; r = r + denom;
} else { }
else
{
// q = q + 1; // q = q + 1;
r = r - denom; r = r - denom;
} }
} }
return r; return r;
} }
} }