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

Merge branch 'master' of R:\AdventOfCode

Browse Source
This commit is contained in:
Tommy Öman
2018-12-24 01:07:19 +01:00
parent 953cae2077 abaaf01763
commit 226ebb9774
1 changed files with 42 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

59
2018_08/Program.cs
View File

@ -12,8 +12,8 @@ namespace _2018_08
{ {
static void Main(string[] args) static void Main(string[] args)
{ {
//string[] resTab = File.ReadAllText(@"..\..\..\Data\Adventofcode_181208\2018_08_data.txt").Split(' '); string[] resTab = File.ReadAllText(@"..\..\..\Data\Adventofcode_181208\2018_08_data.txt").Split(' ');
string[] resTab = @"2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2".Split(' '); //string[] resTab = @"2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2".Split(' ');
int[] numbers = new int[resTab.Length]; int[] numbers = new int[resTab.Length];
for (int i = 0; i < resTab.Length; i++) for (int i = 0; i < resTab.Length; i++)
{ {
@ -25,27 +25,49 @@ namespace _2018_08
var pgm = new Program(); var pgm = new Program();
int x = pgm.CalculateMetaData(numbers); int x = pgm.CalculateMetaData(numbers);
WriteLine();
WriteLine($"summa = {x}");
ReadKey();
} }
private int CalculateMetaData(int[] numbers) private int CalculateMetaData(int[] numbers)
{ {
int tempSum = 0; int tempSum = 0;
int omgStart = 0;
LinkedList<TreeNode> llT = new LinkedList<TreeNode>(); LinkedList<TreeNode> llT = new LinkedList<TreeNode>();
TreeNode strtNode = new TreeNode(0, numbers); while (omgStart < numbers.Length)
llT.AddLast(strtNode);
int headEnd = 0;
int firstAnt = strtNode.AntChilds;
TreeNode nxt = new TreeNode(strtNode.HeaderStart+2, numbers);
for (int i = 0; i < firstAnt; i++)
{ {
headEnd = this.SubProc(nxt, numbers, llT); TreeNode strtNode = new TreeNode(omgStart, numbers);
if (i < firstAnt - 1) llT.AddLast(strtNode);
int headEnd = 0;
int firstAnt = strtNode.AntChilds;
TreeNode nxt = new TreeNode(strtNode.HeaderStart + 2, numbers);
for (int i = 0; i < firstAnt; i++)
{ {
nxt = new TreeNode(headEnd , numbers); headEnd = this.SubProc(nxt, numbers, llT);
llT.AddLast(nxt); if (i < firstAnt - 1)
{
nxt = new TreeNode(headEnd, numbers);
//llT.AddLast(nxt);
}
} }
strtNode.PrepMetatab(headEnd - strtNode.NodeEnd + strtNode.AntMetaEntries);
omgStart= strtNode.NodeEnd;
}
WriteLine();
foreach (var ll in llT)
{
Write($"Obj Nr: {ll.ObjNr} ({ll.HeaderStart},{ll.NodeEnd});");
foreach (int x in ll.MetaTab)
{
Write($"{x}, ");
tempSum += x;
}
WriteLine();
} }
return tempSum; return tempSum;
@ -53,14 +75,13 @@ namespace _2018_08
private int SubProc(TreeNode tn, int[] numbers, LinkedList<TreeNode> ll) private int SubProc(TreeNode tn, int[] numbers, LinkedList<TreeNode> ll)
{ {
ll.AddLast(tn);
int nEnd = 0; int nEnd = 0;
if (tn.AntChilds > 0) if (tn.AntChilds > 0)
{ {
var tnx = new TreeNode(tn.HeaderStart + 2, numbers); var tnx = new TreeNode(tn.HeaderStart + 2, numbers);
ll.AddLast(tnx); nEnd = SubProc(tnx, numbers, ll) - tnx.HeaderStart;
nEnd = SubProc(tnx, numbers, ll);
} }
tn.PrepMetatab(nEnd); tn.PrepMetatab(nEnd);
@ -71,6 +92,7 @@ namespace _2018_08
public class TreeNode public class TreeNode
{ {
public int ObjNr { get; set; }
public int HeaderStart { get; set; } public int HeaderStart { get; set; }
public int AntChilds { get; set; } public int AntChilds { get; set; }
public int AntMetaEntries { get; set; } public int AntMetaEntries { get; set; }
@ -78,8 +100,11 @@ namespace _2018_08
public int NodeEnd { get; set; } public int NodeEnd { get; set; }
public int[] NumberTab { get; set; } public int[] NumberTab { get; set; }
static int nr;
public TreeNode(int treeNodeStart, int[] NumTab) public TreeNode(int treeNodeStart, int[] NumTab)
{ {
TreeNode.nr++;
ObjNr = TreeNode.nr;
NumberTab = NumTab; NumberTab = NumTab;
HeaderStart = treeNodeStart; HeaderStart = treeNodeStart;
AntChilds = NumberTab[HeaderStart]; AntChilds = NumberTab[HeaderStart];