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

Fungerar med exemplet + ett egenkonstruerat exempel

Browse Source
This commit is contained in:
Tommy Öman
2019-01-03 21:13:11 +01:00
parent 66d0641376
commit c2fe917110
5 changed files with 523 additions and 144 deletions
Download Patch File Download Diff File Expand all files Collapse all files

338
2018_08/Program.cs
View File

@ -1,4 +1,7 @@
using System.Collections.Generic;
using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using static System.Console;
namespace _2018_08
@ -9,9 +12,9 @@ namespace _2018_08
{
bool own = false;
int y = 0;
//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 2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2".Split(' ');
string[] resTab = @"2 3 2 1 2 3 1 1 0 2 1 2 3 0 3 4 5 6 7 8 9 0 4 10 11 12 13 14 2 2 0 3 15 16 17 0 2 18 19 20 21 22 23 24".Split(' '); own = true;
//string[] resTab = @"2 3 2 1 2 3 1 1 0 2 1 2 3 0 3 4 5 6 7 8 9 0 4 10 11 12 13 14 2 2 0 3 15 16 17 0 2 18 19 20 21 22 23 24".Split(' '); own = true;
int[] numbers = new int[resTab.Length];
for (int i = 0; i < resTab.Length; i++)
{
@ -35,7 +38,7 @@ namespace _2018_08
ReadKey();
var pgm = new Program();
//int x = pgm.CalculateMetaData(numbers);
int x = pgm.CalcMetaData(numbers);
WriteLine();
@ -43,147 +46,36 @@ namespace _2018_08
ReadKey();
}
#region oldCode
//private int CalculateMetaData(int[] numbers)
//{
// int tempSum = 0;
// int omgStart = 0;
// LinkedList<TreeNode> llT = new LinkedList<TreeNode>();
// while (omgStart < numbers.Length)
// {
// TreeNode strtNode = new TreeNode(omgStart, numbers);
// 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);
// if (i < firstAnt - 1)
// {
// nxt = new TreeNode(headEnd, numbers);
// //llT.AddLast(nxt);
// }
// }
// Write($"start: {strtNode.HeaderStart}, init. end: {strtNode.NodeEnd}, ant. Metas: {strtNode.AntMetaEntries}, ");
// strtNode.PrepMetatab(headEnd - strtNode.NodeEnd + strtNode.AntMetaEntries);
// WriteLine($" fakt. slut {strtNode.NodeEnd}");
// omgStart = strtNode.NodeEnd;
// if (omgStart < numbers.Length)
// {
// for (int i = omgStart; i < omgStart + 5; i++)
// {
// Write($"numbers[{i}]:{numbers[i]}, ");
// }
// WriteLine();
// Write(" ");
// }
// }
// 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;
//}
//private int SubProc(TreeNode tn, int[] numbers, LinkedList<TreeNode> ll)
//{
// ll.AddLast(tn);
// int nEnd = 0;
// int scndAnt = tn.AntChilds;
// if (scndAnt > 0)
// {
// var tnx = new TreeNode(tn.HeaderStart + 2, numbers);
// for (int k = 0; k < scndAnt; k++)
// {
// var xs = SubProc(tnx, numbers, ll);
// WriteLine($"-- tillbaka tnx obj: {tnx.ObjNr} nEnd: {nEnd} svnAnt: {scndAnt} tn obj: {tn.ObjNr}");
// nEnd = xs - tnx.HeaderStart;
// if (k < scndAnt - 1)
// {
// //tnx = new TreeNode(nEnd, numbers);
// tnx = new TreeNode(tnx.NodeEnd, numbers);
// }
// else
// {
// if (scndAnt > 1) {
// nEnd = xs;
// }
// //else
// //{
// // nEnd = xs - tn.NodeEnd;
// //}
// }
// }
// }
// tn.PrepMetatab(nEnd);
// return tn.NodeEnd;
//}
#endregion
private int CalcMetaData(int[] nums)
private int CalcMetaData(int[] nums)
{
int metaSum = 0;
int last_pos = 0;
LinkedList<TreeNode> ll = new LinkedList<TreeNode>();
TreeNode tnStart = new TreeNode(0, nums, ll);
TreeNode tnStart = new TreeNode(nums, null);
TreeNode tnTmp = tnStart;
TreeNode tnAkt = tnStart;
while (true)
{
tnAkt = new TreeNode(nums, tnTmp);
tnTmp = tnAkt;
if (tnAkt.LC.Level < 0)
break;
}
last_pos = diverge(tnStart, ll);
ReadKey();
tnTmp = tnStart;
while (tnTmp!=null)
{
tnTmp.PrepMetatab(tnTmp.NodeEnd);
WriteLine(tnTmp.ToString());
metaSum += tnTmp.MetaValueSum();
tnTmp = tnTmp.Next;
}
WriteLine($" last_pos= {last_pos}");
ReadKey();
return metaSum;
}
private int diverge(TreeNode tn, LinkedList<TreeNode> lnk)
{
int last_pos = 0;
int[] workTable = tn.NumberTab;
int level_amount = tn.AntChilds;
int level_akt_ch = 0;
if (level_amount > 0)
{
var tnx = new TreeNode(tn.HeaderStart + 2, workTable, lnk);
last_pos = tnx.NodeEnd;
last_pos += diverge(tnx, lnk);
tnx.PrepMetatab( last_pos);
}
if (level_akt_ch < level_amount)
{
level_akt_ch++;
var tny = new TreeNode(last_pos, workTable, lnk);
last_pos = tny.NodeEnd;
last_pos += diverge(tny, lnk);
tny.PrepMetatab(tny.NodeEnd + last_pos);
}
tn.PrepMetatab(tn.AntMetaEntries + last_pos);
last_pos = tn.NodeEnd;
return last_pos;
}
}
public class TreeNode
@ -191,22 +83,147 @@ namespace _2018_08
public int ObjNr { get; set; }
public int HeaderStart { get; set; }
public int AntChilds { get; set; }
public int ChildNo { get; set; }
public int AntMetaEntries { get; set; }
public int[] MetaTab { get; set; }
public int NodeEnd { get; set; }
public int[] NumberTab { get; set; }
public TreeNode Previous { get; set; }
public TreeNode Next { get; set; }
public LevelCount LC { get; set; }
static int nr;
public TreeNode(int treeNodeStart, int[] NumTab, LinkedList<TreeNode> links)
int treeNodeStart = 0;
public TreeNode(int[] NumTab, TreeNode tnPrev)
{
TreeNode.nr++;
ObjNr = TreeNode.nr;
NumberTab = NumTab;
HeaderStart = treeNodeStart;
AntChilds = NumberTab[HeaderStart];
AntMetaEntries = NumberTab[HeaderStart + 1];
NodeEnd = HeaderStart + 2 + AntMetaEntries;
links.AddLast(this);
WriteLine(this.ToString());
LC = new LevelCount();
Previous = tnPrev;
if (Previous != null)
{
Previous.Next = this;
}
else
{
LC.Level = 0;
treeNodeStart = 0;
}
Next = null;
SetLevel();
if (LC.Level > -1)
{
HeaderStart = treeNodeStart;
AntChilds = NumberTab[HeaderStart];
AntMetaEntries = NumberTab[HeaderStart + 1];
NodeEnd = HeaderStart + 2 + AntMetaEntries;
WriteLine(this.ToString());
}
}
private void SetLevel()
{
TreeNode wrkTmp = this;
if (Previous != null)
{
if (Previous.AntChilds > 0)
{
LC.Level = Previous.LC.Level + 1;
LC.Nodes = Previous.AntChilds;
ChildNo = 1;
treeNodeStart = Previous.HeaderStart + 2;
}
else
{
if (Previous.ChildNo < Previous.LC.Nodes)
{
LC.Level = Previous.LC.Level;
LC.Nodes = Previous.LC.Nodes;
ChildNo = Previous.ChildNo + 1;
treeNodeStart = Previous.NodeEnd;
}
else
{
LC.Level = Previous.LC.Level - 1;
if (FindStartOfObject(wrkTmp).ChildNo < FindStartOfObject(wrkTmp).LC.Nodes)
{
FindStartOfObject(wrkTmp).PrepMetatab(wrkTmp.Previous.NodeEnd + FindStartOfObject(wrkTmp).AntMetaEntries);
treeNodeStart = FindStartOfObject(wrkTmp).NodeEnd;
wrkTmp.ChildNo = FindStartOfObject(wrkTmp).ChildNo + 1;
wrkTmp.LC.Nodes = FindHeadOfStartOfObject(wrkTmp).AntChilds;
}
else
{
int chld = FindStartOfObject(wrkTmp).ChildNo;
int ndss = FindStartOfObject(wrkTmp).LC.Nodes;
treeNodeStart = wrkTmp.Previous.NodeEnd;
while (FindStartOfObject(wrkTmp).ChildNo == FindStartOfObject(wrkTmp).LC.Nodes && LC.Level > -1)
{
FindStartOfObject(wrkTmp).PrepMetatab(treeNodeStart + FindStartOfObject(wrkTmp).AntMetaEntries);
treeNodeStart = FindStartOfObject(wrkTmp).NodeEnd;
LC.Level = LC.Level - 1;
chld = FindStartOfObject(wrkTmp).ChildNo;
ndss = FindStartOfObject(wrkTmp).LC.Nodes;
}
if (LC.Level <= 0)
{
if (treeNodeStart >= NumberTab.Length)
{
Previous.Next = null;
}
else
{
LC.Level = 0;
}
}
}
}
}
}
}
private TreeNode FindStartOfObject(TreeNode xTree)
{
TreeNode jmfTmp = this;
TreeNode srchTmp = Previous;
if (xTree != null)
{
jmfTmp = xTree;
srchTmp = xTree.Previous;
}
while (srchTmp.LC.Level > jmfTmp.LC.Level && srchTmp.Previous != null)
{
srchTmp = srchTmp.Previous;
}
return srchTmp;
}
private TreeNode FindHeadOfStartOfObject(TreeNode xTree)
{
TreeNode jmfTmp = this;
TreeNode srchTmp = Previous;
if (xTree != null)
{
jmfTmp = xTree;
srchTmp = xTree.Previous;
}
while (srchTmp.LC.Level >= this.LC.Level && srchTmp.Previous != null)
{
srchTmp = srchTmp.Previous;
}
return srchTmp;
}
public void PrepMetatab(int subLen)
@ -219,10 +236,43 @@ namespace _2018_08
}
}
public int MetaValueSum()
{
int tmpMetas = 0;
if (MetaTab != null)
{
for (int y = 0; y < AntMetaEntries; y++)
{
tmpMetas += MetaTab[y];
}
}
else tmpMetas = -1;
return tmpMetas;
}
public override string ToString()
{
string retStr = $"Nr: {ObjNr}, Start: {HeaderStart}, Subobj: {AntChilds}, Metafält: {AntMetaEntries}, Nodend: {NodeEnd}";
string retStr = $"Nr: {ObjNr}, Level: {LC.Level}, Child: {ChildNo} Start: {HeaderStart}, Subobj: {AntChilds}, Metafält: {AntMetaEntries}, Nodend: {NodeEnd}";
if (MetaTab != null)
{
for (int x = 0; x < AntMetaEntries; x++)
{
retStr += $" meta[{x}]: {MetaTab[x]}";
}
}
return retStr;
}
}
public class LevelCount
{
public int Level { get; set; }
public int Nodes { get; set; }
public LevelCount()
{
Level = 0;
Nodes = 0;
}
}
}