Test for multiple values in an if statement in C# [duplicate]

Answer 1

You could perhaps do something like this:

if( Array.LastIndexOf(new int[]{1, 2,3,4}, x) != -1)
{
    //YOUR CODE HERE
}

Not tested, but I believe this would work.

edit Looks like a similar response has already been posted.

Answer 2

I would like to recommend using HashSet(T) Class to check whether the element belongs to the set of elements.

Furthermore, as HashSet<T> is an associative container, its lookup complexity is O(1), i.e. constant time: HashSet(Of T).Contains Method, while Array and List<T> has linear time lookup: O(n). So, HashSet<T> would be the better for lookup.

HashSet<int> numbers = new HashSet<int> { 1, 2, 5, 13, 14 };
int x = 1;
if (numbers.Contains(x))
{
    Console.WriteLine("Contains!");
}

Answer 3

Try this:

if ((new[]{1, 2, 5, 13, 14}).Contains(x)) ...

Answer 4

No, there is no support for comparing directly like that. However, you could use LINQ methods such as Contains(). I could provide an example but it sort of depends how the data items are originally stored.

Answer 5

Though I think the if statement is fine, and making code brief for breifness's sake is useless, here goes:

First approach, assuming you want to go the LINQ route:

if ((new[]{1,2,5,13,14}).Contains(x)){
}

Second approach, ArrayList

if ((new System.Collections.ArrayList(new[]{1,2,5,13,14})).Contains(x)){
}

Third approach, List:

if ((new System.Collections.Generic.List<Int32>(new[]{1,2,5,13,14})).Contains(x)){
}

But keep in mind all of these add more overhead (and really don't add much as far as readability, given the performance consideration).

oh, and working example of the above.