Exemple #1
0
        // Write a program that reads N integers from the console and reverses them using a stack.
        // Use the Stack<int> class.
        public static void Main(string[] args)
        {
            SequenceParser.WarningMessage();
            Console.WriteLine("Task 2 : Enter Interegers (like: '1 2 3' or '1,2,3') to stack and reverse");

            var digits = SequenceParser.StringNumberSequenceToList(Console.ReadLine());

            Stack <int> stack = new Stack <int>();

            foreach (var item in digits)
            {
                stack.Push(item);
            }

            Console.WriteLine("Stack BEFORE reversal :");
            foreach (var item in stack)
            {
                Console.Write(item);
            }

            Console.WriteLine();

            ReverseStackRecursive(stack);

            Console.WriteLine("Stack AFTER reversal :");
            while (stack.Count > 0)
            {
                Console.Write(stack.Pop());
            }

            Console.WriteLine();
        }
Exemple #2
0
        public static void Main(string[] args)
        {
            SequenceParser.WarningMessage();
            Console.WriteLine("Task 1 : Enter a sequence of positive integer digits (like: '1 2 3' or '1,2,3') \nto get sum and average");

            List <int> list = SequenceParser.StringNumberSequenceToList(Console.ReadLine());

            Console.WriteLine($"Sum: {list.Sum()}");
            Console.WriteLine($"Average: {list.Average()}");
        }
Exemple #3
0
        public static void Main(string[] args)
        {
            SequenceParser.WarningMessage();

            Console.WriteLine("Task 4 : Enter sequence of Interegers (like: '1 2 2 2 3' or '1, 2, 2, 2, 3')");
            Console.WriteLine("To find the longest subsequence of equal digits (like: 2 2 2)");

            var digits = SequenceParser.StringNumberSequenceToList(Console.ReadLine());

            var result = MaximalSubsequenceOfEquals(digits);

            result.ForEach(x => Console.Write(x + " "));
            Console.WriteLine();
        }
Exemple #4
0
        public static void Main(string[] args)
        {
            SequenceParser.WarningMessage();

            Console.WriteLine("Task 6 : Enter sequence of Interegers (like: ' 4, 2, 2, 5, 2, 3, 2, 3, 1, 5, 2 ')");
            Console.WriteLine("Program that removes from given sequence all numbers that occur odd number of times.");

            var digits = SequenceParser.StringNumberSequenceToList(Console.ReadLine());

            digits = RemoveAllOddTimesOccuranceElementsWithFind(digits);

            digits.ForEach(x => Console.Write(x + " "));
            Console.WriteLine();
        }
Exemple #5
0
        public static void Main(string[] args)
        {
            SequenceParser.WarningMessage();
            Console.WriteLine("Task 3 : Enter sequence of Interegers (like: '1 -2 3' or '1,-2,3') to sort in increasing order");

            var digits = SequenceParser.StringNumberSequenceToList(Console.ReadLine());

            //// digits.Sort();

            var instance = new SelectionSort();

            instance.Sort(digits);

            Console.WriteLine("Ordered : ");
            digits.ForEach(x => Console.Write(x + " "));
            Console.WriteLine("Done! ");
        }
Exemple #6
0
        public static void Main(string[] args)
        {
            SequenceParser.WarningMessage();

            Console.WriteLine("Task 5 : Enter sequence of Interegers (like: '1 2 -2 2 -3' or '1, 2, -2, 2, -3')");
            Console.WriteLine("To remove all negavtive occurances in the sequence");

            var digits = SequenceParser.StringNumberSequenceToList(Console.ReadLine());

            RemoveAllNegativeElements(digits);

            //// digits = RemoveAllNegativeWithFind(digits); // variant with linq FindAll()

            //// digits = RemoveAllNegativeWithWhere(digits); // variant with Linq Where() clause

            digits.ForEach(x => Console.Write(x + " "));
            Console.WriteLine();
        }