package ALeetCode.comp.p184;

/**
 * Created by HuGuodong on 12/8/19.
 */
public class Problem4 {

  static class Solution {

    int[] color = {0, 1, 2};

    public int numOfWays(int n) {
      return 0;
    }

    private void helper(int lvl, int m) {
      if (lvl == m) return;
      for (int i = 0; i < 2; i++) {
        // choose;

      }
    }
  }

  public static void main(String[] args) {

    Solution s = new Solution();
    System.out.println();
  }
}
