public static int Problem2(QuirkNode baseNode)
{
List <int> lstValueNodes = new List <int>();
foreach (var metadataEntry in baseNode.lstMetadataEntries)
{
AddNodesValue(baseNode.ChildNodes.ElementAtOrDefault(metadataEntry - 1), ref lstValueNodes);
}
return(lstValueNodes.Sum());
}
public static int Problem1(string[] linesInput, out QuirkNode baseNode)
{
List <string> dataValuesSTR = linesInput[0].Split(' ').ToList();
LinkedList <int> dataValues = new LinkedList <int>(dataValuesSTR.Select(r => Convert.ToInt32(r)));
List <int> sumNumbers = new List <int>();
int baseID = (int)'A' - 1;
baseNode = new QuirkNode();
baseNode.ID = (char)baseID;
baseNode = RecursiveEat(ref dataValues, ref sumNumbers, ref baseID);
return(sumNumbers.Sum(r => r));
}
public static void AddNodesValue(QuirkNode nodum, ref List <int> lstValuesNodes)
{
if (nodum == null)
{
lstValuesNodes.Add(0);
return;
}
if (nodum.ChildNodes.Count() == 0)
{
lstValuesNodes.Add(nodum.lstMetadataEntries.Sum());
}
else
{
foreach (var Metadata in nodum.lstMetadataEntries)
{
AddNodesValue(nodum.ChildNodes.ElementAtOrDefault(Metadata - 1), ref lstValuesNodes);
}
}
}
public static QuirkNode RecursiveEat(ref LinkedList <int> dataValues, ref List <int> sumNumbers, ref int IDCarrier)
{
IDCarrier++;
int NumberOfChildNodes = dataValues.First();
int NumberOfMetadataEntries = dataValues.Skip(1).First();
dataValues.RemoveFirst();
dataValues.RemoveFirst();
QuirkNode node = new QuirkNode();
node.ID = (char)IDCarrier;
if (NumberOfChildNodes == 0)
{
for (int w = 0; w < NumberOfMetadataEntries; w++)
{
sumNumbers.Add(dataValues.First());
node.lstMetadataEntries.Add(dataValues.First());
dataValues.RemoveFirst();
}
return(node);
}
else
{
for (int i = 0; i < NumberOfChildNodes; i++)
{
QuirkNode childNode = RecursiveEat(ref dataValues, ref sumNumbers, ref IDCarrier);
node.ChildNodes.AddLast(childNode);
}
for (int w = 0; w < NumberOfMetadataEntries; w++)
{
sumNumbers.Add(dataValues.First());
node.lstMetadataEntries.Add(dataValues.First());
dataValues.RemoveFirst();
}
return(node);
}
}
