refactor 276

fishercoder1534 · fishercoder1534 · commit f31ac9b4ef7e · 2018-11-20T07:50:37.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_276.java b/src/main/java/com/fishercoder/solutions/_276.java
@@ -1,6 +1,9 @@
 package com.fishercoder.solutions;
 
-/**There is a fence with n posts, each post can be painted with one of the k colors.
+/**
+ * 276. Paint Fence
+
+ There is a fence with n posts, each post can be painted with one of the k colors.
 
  You have to paint all the posts such that no more than two adjacent fence posts have the same color.
 
@@ -10,19 +13,21 @@
  n and k are non-negative integers.*/
 
 public class _276 {
-    public int numWays(int n, int k) {
-        if (n == 0) {
-            return 0;
-        } else if (n == 1) {
-            return k;
-        }
-        int sameColorCnt = k;
-        int diffColorCnt = k * (k - 1);
-        for (int i = 2; i < n; i++) {
-            int temp = diffColorCnt;
-            diffColorCnt = (diffColorCnt + sameColorCnt) * (k - 1);
-            sameColorCnt = temp;
+    public static class Solution1 {
+        public int numWays(int n, int k) {
+            if (n == 0) {
+                return 0;
+            } else if (n == 1) {
+                return k;
+            }
+            int sameColorCnt = k;
+            int diffColorCnt = k * (k - 1);
+            for (int i = 2; i < n; i++) {
+                int temp = diffColorCnt;
+                diffColorCnt = (diffColorCnt + sameColorCnt) * (k - 1);
+                sameColorCnt = temp;
+            }
+            return sameColorCnt + diffColorCnt;
         }
-        return sameColorCnt + diffColorCnt;
     }
 }
