solve problem Spiral Matrix II

Author: P-ppc

README.md

@@ -260,9 +260,10 @@ All solutions will be accepted!
 |338|[Counting Bits](https://leetcode-cn.com/problems/counting-bits/description/)|[java/py/js](./algorithms/CountingBits)|Medium|
 |287|[Find The Duplicate Number](https://leetcode-cn.com/problems/find-the-duplicate-number/description/)|[java/py/js](./algorithms/FindTheDuplicateNumber)|Medium|
 |807|[Max Increase To Keep City Skyline](https://leetcode-cn.com/problems/max-increase-to-keep-city-skyline/description/)|[java/py/js](./algorithms/MaxIncreaseToKeepCitySkyline)|Medium|
+|59|[Spiral Matrix II](https://leetcode-cn.com/problems/spiral-matrix-ii/description/)|[java/py/js](./algorithms/SpiralMatrixII)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|
 |:-|:-|:-|:-|
 |596|[Big Countries](https://leetcode-cn.com/problems/big-countries/description/)|[mysql](./database/BigCountries)|Easy|
-|182|[Duplicate Emails](https://leetcode-cn.com/problems/duplicate-emails/description/)|[mysql](./algorithms/DuplicateEmails)|Easy|
+|182|[Duplicate Emails](https://leetcode-cn.com/problems/duplicate-emails/description/)|[mysql](./database/DuplicateEmails)|Easy|

algorithms/SpiralMatrixII/README.md

@@ -0,0 +1,2 @@
+# Spiral Matrix II
+This problem is easy to solve

algorithms/SpiralMatrixII/Solution.java

@@ -0,0 +1,40 @@
+class Solution {
+    public int[][] generateMatrix(int n) {
+        int[][] matrix = new int[n][n];
+
+        int i = 0,
+            j = 0,
+            topLimit = 0,
+            leftLimit = 0,
+            bottomLimit = n - 1,
+            rightLimit = n - 1,
+            xDirection = 1,
+            yDirection = 0;
+
+        for (int v = 1, max = (int) Math.pow(n, 2); v <= max; v++) {
+            matrix[i][j] = v;
+
+            if (j + xDirection > rightLimit) {
+                topLimit = i + 1;
+                xDirection = 0;
+                yDirection = 1;
+            } else if (i + yDirection > bottomLimit) {
+                rightLimit = i - 1;
+                xDirection = -1;
+                yDirection = 0;
+            } else if (j + xDirection < leftLimit) {
+                bottomLimit = i - 1;
+                xDirection = 0;
+                yDirection = -1;
+            } else if (i + yDirection < topLimit) {
+                leftLimit = j + 1;
+                xDirection = 1;
+                yDirection = 0;
+            }
+
+            i += yDirection;
+            j += xDirection;
+        }
+        return matrix;
+    }
+}

algorithms/SpiralMatrixII/solution.js

@@ -0,0 +1,43 @@
+/**
+ * @param {number} n
+ * @return {number[][]}
+ */
+var generateMatrix = function(n) {
+    let matrix = []
+    
+    for (let i = 0; i < n; i++) {
+        matrix.push(new Array(n));
+    }
+    
+    let i = j = 0,
+        topLimit = leftLimit = 0,
+        bottomLimit = rightLimit = n - 1,
+        xDirection = 1,
+        yDirection = 0
+    
+    for (let v = 1; v <= Math.pow(n, 2); v++) {
+        matrix[i][j] = v
+        
+        if (j + xDirection > rightLimit) {
+            topLimit = i + 1
+            xDirection = 0
+            yDirection = 1
+        } else if (i + yDirection > bottomLimit) {
+            rightLimit = i - 1
+            xDirection = -1
+            yDirection = 0
+        } else if (j + xDirection < leftLimit) {
+            bottomLimit = i - 1
+            xDirection = 0
+            yDirection = -1
+        } else if (i + yDirection < topLimit) {
+            leftLimit = j + 1
+            xDirection = 1
+            yDirection = 0
+        }
+        
+        i += yDirection
+        j += xDirection
+    }
+    return matrix
+};

algorithms/SpiralMatrixII/solution.py

@@ -0,0 +1,42 @@
+class Solution(object):
+    def generateMatrix(self, n):
+        """
+        :type n: int
+        :rtype: List[List[int]]
+        """
+        matrix = []
+        for i in xrange(n):
+            matrix.append([0] * n)
+        
+        i = j = 0
+        
+        top_limit = left_limit = 0
+        bottom_limit = right_limit = n - 1
+        
+        x_direction = 1
+        y_direction = 0
+        
+        for v in xrange(1, pow(n, 2) + 1):
+            matrix[i][j] = v
+            
+            if j + x_direction > right_limit:
+                top_limit = i + 1
+                x_direction = 0
+                y_direction = 1
+            elif i + y_direction > bottom_limit:
+                right_limit = i - 1
+                x_direction = -1
+                y_direction = 0
+            elif j + x_direction < left_limit:
+                bottom_limit = i - 1
+                x_direction = 0
+                y_direction = -1
+            elif i + y_direction < top_limit:
+                left_limit = j + 1
+                x_direction = 1
+                y_direction = 0
+            
+            i += y_direction
+            j += x_direction
+        
+        return generateMatrix