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

Ändringar med ny variant

Browse Source
This commit is contained in:
Tommy Öman
2018-12-31 11:58:36 +01:00
parent c6dfb6e967
commit 66d0641376
2 changed files with 153 additions and 63 deletions
Download Patch File Download Diff File Expand all files Collapse all files

216
2018_08/Program.cs
View File

@ -7,99 +7,183 @@ namespace _2018_08
{ {
static void Main(string[] args) static void Main(string[] args)
{ {
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 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(' '); 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]; int[] numbers = new int[resTab.Length];
for (int i = 0; i < resTab.Length; i++) for (int i = 0; i < resTab.Length; i++)
{ {
numbers[i] = int.Parse(resTab[i]); numbers[i] = int.Parse(resTab[i]);
} }
int y = 0; if (own)
for(int z = 1; z < 25; z++)
{ {
y += z; for (int z = 1; z < 25; z++)
{
y += z;
}
} }
WriteLine($"Antal värden = {resTab.Length} svar = {y}"); Write($"Antal värden = {resTab.Length}");
if (own)
{
WriteLine($" svar = {y}");
}
else WriteLine();
ReadKey(); ReadKey();
var pgm = new Program(); var pgm = new Program();
int x = pgm.CalculateMetaData(numbers); //int x = pgm.CalculateMetaData(numbers);
int x = pgm.CalcMetaData(numbers);
WriteLine(); WriteLine();
WriteLine($"summa = {x}"); WriteLine($"summa = {x}");
ReadKey(); 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;
private int CalculateMetaData(int[] numbers) // 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)
{ {
int tempSum = 0; int metaSum = 0;
int omgStart = 0; int last_pos = 0;
LinkedList<TreeNode> llT = new LinkedList<TreeNode>(); LinkedList<TreeNode> ll = new LinkedList<TreeNode>();
while (omgStart < numbers.Length) TreeNode tnStart = new TreeNode(0, nums, ll);
{
TreeNode strtNode = new TreeNode(omgStart, numbers);
llT.AddLast(strtNode);
int headEnd = 0;
int firstAnt = strtNode.AntChilds;
TreeNode nxt = new TreeNode(strtNode.HeaderStart + 2, numbers); last_pos = diverge(tnStart, ll);
for (int i = 0; i < firstAnt; i++) WriteLine($" last_pos= {last_pos}");
{ ReadKey();
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; return metaSum;
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) private int diverge(TreeNode tn, LinkedList<TreeNode> lnk)
{ {
ll.AddLast(tn); int last_pos = 0;
int nEnd = 0; int[] workTable = tn.NumberTab;
int level_amount = tn.AntChilds;
int level_akt_ch = 0;
if (tn.AntChilds > 0) if (level_amount > 0)
{ {
var tnx = new TreeNode(tn.HeaderStart + 2, numbers); var tnx = new TreeNode(tn.HeaderStart + 2, workTable, lnk);
nEnd = SubProc(tnx, numbers, ll) - tnx.HeaderStart; last_pos = tnx.NodeEnd;
last_pos += diverge(tnx, lnk);
tnx.PrepMetatab( last_pos);
} }
tn.PrepMetatab(nEnd); if (level_akt_ch < level_amount)
return tn.NodeEnd; {
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 public class TreeNode
@ -111,9 +195,8 @@ namespace _2018_08
public int[] MetaTab { get; set; } public int[] MetaTab { get; set; }
public int NodeEnd { get; set; } public int NodeEnd { get; set; }
public int[] NumberTab { get; set; } public int[] NumberTab { get; set; }
static int nr; static int nr;
public TreeNode(int treeNodeStart, int[] NumTab) public TreeNode(int treeNodeStart, int[] NumTab, LinkedList<TreeNode> links)
{ {
TreeNode.nr++; TreeNode.nr++;
ObjNr = TreeNode.nr; ObjNr = TreeNode.nr;
@ -122,11 +205,13 @@ namespace _2018_08
AntChilds = NumberTab[HeaderStart]; AntChilds = NumberTab[HeaderStart];
AntMetaEntries = NumberTab[HeaderStart + 1]; AntMetaEntries = NumberTab[HeaderStart + 1];
NodeEnd = HeaderStart + 2 + AntMetaEntries; NodeEnd = HeaderStart + 2 + AntMetaEntries;
links.AddLast(this);
WriteLine(this.ToString());
} }
public void PrepMetatab(int subLen) public void PrepMetatab(int subLen)
{ {
NodeEnd += subLen; NodeEnd = subLen;
MetaTab = new int[AntMetaEntries]; MetaTab = new int[AntMetaEntries];
for (int i = 0, j = NodeEnd - AntMetaEntries; j < NodeEnd; j++, i++) for (int i = 0, j = NodeEnd - AntMetaEntries; j < NodeEnd; j++, i++)
{ {
@ -134,5 +219,10 @@ namespace _2018_08
} }
} }
public override string ToString()
{
string retStr = $"Nr: {ObjNr}, Start: {HeaderStart}, Subobj: {AntChilds}, Metafält: {AntMetaEntries}, Nodend: {NodeEnd}";
return retStr;
}
} }
} }

BIN
Data/AdventOfCode_181208/egetex.xlsx Normal file
View File

Binary file not shown.