public InOut(string s, int i, string o) : base(new Input(s, i), Helfer.AssembleChar(o)) { outputStringConverter = arg => Helfer.Arrayausgabe("Erwartet: ", arg, false, ", ", replace, replacement); ergStringConverter = arg => Helfer.Arrayausgabe("Ausgabe: ", arg, false, ", ", replace, replacement); CompareOutErg = Helfer.ArrayVergleich; HasMaxDur = false; AddSolver(Scheduler); }
public InOut(string s, int h, string s2) : base(new Input(s, h), Helfer.AssembleChar(s2)) { ergStringConverter = arg => Helfer.Arrayausgabe <char>("Ergebnis: ", arg); outputStringConverter = arg => Helfer.Arrayausgabe <char>("Erwartet: ", arg); CompareOutErg = (arg, arg2) => Helfer.ArrayVergleich <char>(arg, arg2); AddSolver((arg, erg) => erg.Setze(arg.tree.GetValuesAtHeight(arg.height)), "Iterativ"); }
/* * Hi, here's your problem today. This problem was recently asked by Apple: * * Given a list of strings, find the list of characters that appear in all strings. * * Here's an example and some starter code: * * def common_characters(strs): # Fill this in. # # print(common_characters(['google', 'facebook', 'youtube'])) # ['e', 'o'] */ public InOut(string s, string s2) : base(Helfer.AssembleString(s), Helfer.AssembleChar(s2), true) { AddSolver(Find_Common_Characters); }
public Input(string tasks, int delay) { this.tasks = Helfer.AssembleChar(tasks); this.delay = delay; }
public InOut(string c, string c2) : base(Helfer.AssembleChar(c), Helfer.AssembleChar(c2), true) { AddSolver(Solver1); }