SortedSet<AbstractMap.SimpleImmutableEntry<String, String> > cards =
new TreeSet<AbstractMap.SimpleImmutableEntry<String, String> >(new CardComparator());

for (String suite : suites)
for (String face : faces)
cards.add(new AbstractMap.SimpleImmutableEntry<String, String>(suite, face));

Boolean containsEntry = cards.contains(new AbstractMap.SimpleImmutableEntry<String, String>("h", "A"));

if (containsEntry) System.out.println("Deck contains 'Ace of Hearts'");
else System.out.println("'Ace of Hearts' not in deck");

import java.util.Comparator;
import java.util.AbstractMap;
import java.util.TreeSet;
import java.util.SortedSet;

public class Solution746
{
public static void main(String[] args)
{
String[] suites = new String[]{"h", "d", "c", "s"};
String[] faces = new String[]{"2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A"};

SortedSet<AbstractMap.SimpleImmutableEntry<String, String> > cards =
new TreeSet<AbstractMap.SimpleImmutableEntry<String, String> >(new CardComparator());

for (String suite : suites)
for (String face : faces)
cards.add(new AbstractMap.SimpleImmutableEntry<String, String>(suite, face));

Boolean containsEntry = cards.contains(new AbstractMap.SimpleImmutableEntry<String, String>("h", "A"));

if (containsEntry) System.out.println("Deck contains 'Ace of Hearts'");
else System.out.println("'Ace of Hearts' not in deck");

for (AbstractMap.SimpleImmutableEntry<String, String> card : cards)
System.out.printf("(%s,%s), ", card.getKey(), card.getValue());
}
}

class CardComparator implements Comparator<AbstractMap.SimpleImmutableEntry<String, String> >
{
public int compare(AbstractMap.SimpleImmutableEntry<String, String> left, AbstractMap.SimpleImmutableEntry<String, String> right)
{
String lv = left.getValue(); try { lv = String.format("%03d", Integer.parseInt(lv)); } catch (Exception e) {}
String rv = right.getValue(); try { rv = String.format("%03d", Integer.parseInt(rv)); } catch (Exception e) {}
return (left.getKey() + lv).compareTo(right.getKey() + rv);
}
}