add skeleton for 1134

fishercoder1534 · fishercoder1534 · commit 0d276fd0a48f · 2019-11-28T11:38:18.000-08:00
diff --git a/README.md b/README.md
@@ -39,6 +39,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | O(n) | O(m) | |Easy||
 |1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | O(1) | O(1) | |Easy||
 |1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | O(n) | O(n) | |Easy||
+|1134|[Armstrong Number](https://leetcode.com/problems/armstrong-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) |  |  | |Easy||
 |1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | O(n) | O(n) | |Easy||
 |1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | | | |Easy||
 |1119|[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) | | | [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1134.java b/src/main/java/com/fishercoder/solutions/_1134.java
@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1134. Armstrong Number
+ *
+ * The k-digit number N is an Armstrong number if and only if the k-th power of each digit sums to N.
+ * Given a positive integer N, return true if and only if it is an Armstrong number.
+ *
+ * Example 1:
+ * Input: 153
+ * Output: true
+ * Explanation:
+ * 153 is a 3-digit number, and 153 = 1^3 + 5^3 + 3^3.
+ *
+ * Example 2:
+ * Input: 123
+ * Output: false
+ * Explanation:
+ * 123 is a 3-digit number, and 123 != 1^3 + 2^3 + 3^3 = 36.
+ *
+ * Note:
+ * 1 <= N <= 10^8
+ * */
+public class _1134 {
+    public static class Solution1 {
+        public boolean isArmstrong(int N) {
+            return false;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1134Test.java b/src/test/java/com/fishercoder/_1134Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1134;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1134Test {
+    private static _1134.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1134.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.isArmstrong(153));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(false, solution1.isArmstrong(123));
+    }
+}
