IQ Test

IQ Test

Description:

Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given numbers finds one that is different in evenness, and return a position of this number.

! Keep in mind that your task is to help Bob solve a real IQ test, which means indexes of the elements start from 1 (not 0)

Examples :

IQ.Test("2 4 7 8 10") => 3 // Third number is odd, while the rest of the numbers are even

IQ.Test("1 2 1 1") => 2 // Second number is even, while the rest of the numbers are odd

using System;
using System.Linq;

public class IQ
    {
        public static int Test(string numbers)
        { 
             //Your code is here...
               int[] array = numbers.Split(' ').Select(x => Convert.ToInt32(x)).ToArray();
            int evenCount = array.Count(x => x % 2 == 0);
            int number = 1;
            if (evenCount > 1)
            {
                for (int i = 0; i < array.Length; i++)
                {
                    if (array[i] % 2 == 1)
                    {
                        number = i + 1;
                        break;
                    }
                }
            }
            else
            {
                for (int i = 0; i < array.Length; i++)
                {
                    if (array[i] % 2 == 0)
                    {
                        number = i + 1;
                        break;
                    }
                }
            }
            return number;
        }
    }

 

其他人的解法

int类的静态方法 public static int Parse(string s);
需要注意groupBy的返回值

using System;
using System.Linq;

public class IQ
    {
        public static int Test(string numbers)
        { 
            var ints = numbers.Split(' ').Select(int.Parse).ToList();
            var unique = ints.GroupBy(n => n % 2).OrderBy(c => c.Count()).First().First();
            return ints.FindIndex(c => c == unique) + 1;
        }
    }

 

作者:Chuck Lu    GitHub