private static void GetGreatestCharFromSeperation(AdditionalTasks additionalTasks) { MyQueue <char> seperatedQueue = new MyQueue <char>(); seperatedQueue.Insert('t'); seperatedQueue.Insert('a'); seperatedQueue.Insert('x'); seperatedQueue.Insert('#'); seperatedQueue.Insert('m'); seperatedQueue.Insert('#'); seperatedQueue.Insert('r'); seperatedQueue.Insert('a'); seperatedQueue.Insert('b'); Console.WriteLine(additionalTasks.GetGreatestCharFromSeperation(seperatedQueue)); }
private static void GetEqualDistancePairs(AdditionalTasks additionalTasks) { Node <int> list = new Node <int>(1, new Node <int>(2, new Node <int>(3, new Node <int>(5, new Node <int>(6) )))); Node <KeyValuePair <int, int> > result = additionalTasks.GetEqualDistancePairs(list); while (result != null) { Console.WriteLine($"{result.GetValue().Value} , {result.GetValue().Key}"); result = result.GetNext(); } }
static void Main(string[] args) { RecursionTasks recursion = new RecursionTasks(); QueueTasks queueTasks = new QueueTasks(); AdditionalTasks additionalTasks = new AdditionalTasks(); MyQueue <Trip> trips = new MyQueue <Trip>(); MyQueue <Family> familyQ1 = new MyQueue <Family>(); familyQ1.Insert(new Family("1", "shiran", 1)); familyQ1.Insert(new Family("1", "miki", 2)); familyQ1.Insert(new Family("1", "lili", 2)); familyQ1.Insert(new Family("1", "zizi", 6)); trips.Insert(new Trip("Tel aviv", "1", new DateTime(2020, 3, 5), 100, familyQ1)); MyQueue <Family> familyQ2 = new MyQueue <Family>(); familyQ2.Insert(new Family("2", "shiran", 4)); familyQ2.Insert(new Family("2", "miki", 2)); familyQ2.Insert(new Family("2", "lili", 3)); familyQ2.Insert(new Family("2", "zizi", 5)); trips.Insert(new Trip("Jerusalem", "2", new DateTime(2020, 3, 3), 80, familyQ2)); Console.WriteLine(queueTasks.OperateDriveAndHike(new DateTime(2020, 3, 4), new DateTime(2020, 4, 4), "2", trips)); //OperateSuperMarket(); //GetGreatestCharFromSeperation(additionalTasks); //GetEqualDistancePairs(additionalTasks); //Console.WriteLine(Trouble(2,6)); //TestTrackingTableQueue(); //DisplayAsTable(recursion); //recursion.PrintAllEvenDigits(123456789); //MergeSuperQueues(queueTasks); //ArrangeSHop(queueTasks); //GetMiddleQueue(queueTasks); //GetPairQueue(queueTasks); //ReverseQueue(queueTasks); //MergeSortedQueues(queueTasks); //Jobs(queueTasks); //Carriers(queueTasks); }