refactor for format

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_526.java

@@ -1,7 +1,9 @@
 package com.fishercoder.solutions;
 
 /**
- * Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully
+ * 526. Beautiful Arrangement
+ * Suppose you have N integers from 1 to N.
+ * We define a beautiful arrangement as an array that is constructed by these N numbers successfully
  * if one of the following is true for the ith position (1 ≤ i ≤ N) in this array:
 
  The number at the ith position is divisible by i.
@@ -30,27 +32,28 @@
  N is a positive integer and will not exceed 15.
  */
 public class _526 {
-    //A good post to look at: https://discuss.leetcode.com/topic/79916/java-solution-backtracking and it's generic template afterwards for backtracking problems
-
-    int count = 0;
-
-    public int countArrangement(int N) {
-        backtracking(N, new int[N + 1], 1);
-        return count;
-    }
-
-    private void backtracking(int N, int[] used, int pos) {
-        if (pos > N) {
-            count++;
-            return;
-        }
-        for (int i = 1; i <= N; i++) {
-            if (used[i] == 0 && (i % pos == 0 || pos % i == 0)) {
-                used[i] = 1;
-                backtracking(N, used, pos + 1);
-                used[i] = 0;
-            }
-        }
-    }
+	/**A good post to look at: https://discuss.leetcode.com/topic/79916/java-solution-backtracking
+	 * and there's a generic template afterwards for backtracking problems*/
+
+	int count = 0;
+
+	public int countArrangement(int N) {
+		backtracking(N, new int[N + 1], 1);
+		return count;
+	}
+
+	private void backtracking(int N, int[] used, int pos) {
+		if (pos > N) {
+			count++;
+			return;
+		}
+		for (int i = 1; i <= N; i++) {
+			if (used[i] == 0 && (i % pos == 0 || pos % i == 0)) {
+				used[i] = 1;
+				backtracking(N, used, pos + 1);
+				used[i] = 0;
+			}
+		}
+	}
 
 }