We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Warmup
  4. Plus Minus
  5. Discussions

Plus Minus

  • Rudithus
     + 3 comments

    An ifless (atleast on the surface, I know int.CompareTo() uses if inside it) O(n) solution with C#

                var numbers = new decimal[3];

            foreach (var t in arr)
            {
                numbers[t.CompareTo(0) + 1]++;
            }

            Console.WriteLine(numbers[2] / arr.Length);
            Console.WriteLine(numbers[0] / arr.Length);
            Console.WriteLine(numbers[1] / arr.Length);