Add C++ implementation

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

0054_spiral_matrix/spiral_matrix.c

@@ -1,10 +1,11 @@
 #include <stdio.h>
 #include <stdlib.h>
 
+
 /**
  ** Note: The returned array must be malloced, assume caller calls free().
  **/
-static int* spiralOrder(int** matrix, int matrixSize, int *matrixColSize, int *returnSize)
+int* spiralOrder(int** matrix, int matrixSize, int *matrixColSize, int *returnSize)
 {
     if (matrixSize == 0) {
         *returnSize = 0;

0054_spiral_matrix/spiral_matrix.cc

@@ -5,17 +5,12 @@ using namespace std;
 class Solution {
 public:
     vector<int> spiralOrder(vector<vector<int>>& matrix) {
-        if (matrix.empty()) {
-            return vector<int>();
-        }
-
+        vector<int> res;
         int hor_top = 0;
-        int hor_bottom = matrix.size();
+        int hor_bottom = matrix.size() - 1;
         int ver_left = 0;
-        int ver_right = matrix[0].size();
+        int ver_right = matrix[0].size() - 1;
         int direction = 0;
-        vector<int> res;
-
         while (hor_top <= hor_bottom && ver_left <= ver_right) {
             switch (direction) {
             case 0:

0059_spiral_matrix_ii/spiral_matrix.c

@@ -7,7 +7,7 @@
  * The sizes of the arrays are returned as *returnColumnSizes array.
  * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
  */
-static int** generateMatrix(int n, int* returnSize, int** returnColumnSizes)
+int** generateMatrix(int n, int* returnSize, int** returnColumnSizes)
 {
     int i;
     int **matrix = malloc(n * sizeof(int *));

0059_spiral_matrix_ii/spiral_matrix.cc

@@ -0,0 +1,47 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution {
+public:
+    vector<vector<int>> generateMatrix(int n) {
+        vector<vector<int>> matrix(n, vector<int>(n));
+        int direction = 0;
+        int hor_top = 0;
+        int hor_bottom = n - 1;
+        int ver_left = 0;
+        int ver_right = n - 1;
+        int num  = 0;
+        while (num < n * n) {
+            switch (direction) {
+            case 0:
+                for (int i = ver_left; i <= ver_right; i++) {
+                     matrix[hor_top][i] = ++num;
+                }
+                hor_top++;
+                break;
+            case 1:
+                for (int i = hor_top; i <= hor_bottom; i++) {
+                     matrix[i][ver_right] = ++num;
+                }
+                ver_right--;
+                break;
+            case 2:
+                for (int i = ver_right; i >= ver_left; i--) {
+                     matrix[hor_bottom][i] = ++num;
+                }
+                hor_bottom--;
+                break;
+            case 3:
+                for (int i = hor_bottom; i >= hor_top; i--) {
+                     matrix[i][ver_left] = ++num;
+                }
+                ver_left++;
+                break;
+            }
+            direction++;
+            direction %= 4;
+        }
+        return matrix;
+    }
+};