CardGameOne

Author: qza

src/main/java/codechallenges/dynamicprogramming/CardGameOne.java

@@ -0,0 +1,57 @@
+package codechallenges.dynamicprogramming;
+
+import java.util.Arrays;
+
+/**
+ * CardGameOne
+ *
+ * YetAnotherCardGame @see
+ *
+ * http://community.topcoder.com/stat?c=problem_statement&pm=13912
+ *
+ */
+public class CardGameOne {
+
+ public int[] solve(int[] cards1, int[] cards2) {
+
+ int pileIndex = 0;
+ int pileCard = 0;
+ int[] pile = new int[cards1.length + cards2.length];
+ pile[pileIndex] = 0;
+
+ Arrays.sort(cards1);
+ Arrays.sort(cards2);
+
+ for (int i = 0; i < cards1.length; i++) {
+
+ for (int j = i; j < cards1.length; j++) {
+
+ if (cards1[j] > pileCard) {
+ pileCard = pile[pileIndex] = cards1[j];
+ pileIndex += 1;
+ break;
+ }
+ }
+
+ for (int j = 0; j < cards2.length; j++) {
+
+ if (cards2[j] > pileCard) {
+ pileCard = pile[pileIndex] = cards2[j];
+ pileIndex += 1;
+ break;
+ }
+ }
+ }
+
+ return Arrays.copyOf(pile, pileIndex);
+ }
+
+ public static void main(String[] args) {
+ CardGameOne solver = new CardGameOne();
+ int[] cards1 = new int[]{2, 5};
+ int[] cards2 = new int[]{3, 1};
+ int[] pile = solver.solve(cards1, cards2);
+ System.out.println("Pile: " + Arrays.toString(pile) + ", count: " + pile.length);
+ }
+
+}

src/test/java/codechallenges/dynamicprogramming/CardGameOneTest.java

@@ -0,0 +1,44 @@
+package codechallenges.dynamicprogramming;
+
+import java.util.Arrays;
+import java.util.Collection;
+
+import org.junit.Test;
+import org.junit.runner.RunWith;
+import org.junit.runners.Parameterized;
+
+import static org.junit.Assert.assertArrayEquals;
+
+/**
+ * CardGameOne test class
+ */
+@RunWith(Parameterized.class)
+public class CardGameOneTest {
+
+ int[] cards1;
+ int[] cards2;
+ int[] expected;
+
+ public CardGameOneTest(int[] cards1, int[] cards2, int[] expected) {
+ this.cards1 = cards1;
+ this.cards2 = cards2;
+ this.expected = expected;
+ }
+
+ @Parameterized.Parameters
+ public static Collection<int[][]> parameters() {
+ int[][][] params = new int[][][]{
+ {{2, 5}, {3, 1}, {2, 3, 5}},
+ {{1, 1, 1, 1, 1}, {1, 1, 1, 1, 1}, {1}},
+ {{1, 4, 6, 7, 3}, {1, 7, 1, 5, 7}, {1, 5, 6, 7}}
+ };
+ return Arrays.asList(params);
+ }
+
+ @Test
+ public void shouldFindExpectedLongestSequences() {
+ CardGameOne solver = new CardGameOne();
+ assertArrayEquals(expected, solver.solve(cards1, cards2));
+ }
+
+}