Commita1c8649

committed

Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent60b8388 commita1c8649Copy full SHA for a1c8649

File tree

+53

-10

lines changed

+53

-10

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,11 @@`
`1`	`1`	`#include<stdio.h>`
`2`	`2`	`#include<stdlib.h>`
`3`	`3`
	`4`	`+`
`4`	`5`	`/**`
`5`	`6`	`** Note: The returned array must be malloced, assume caller calls free().`
`6`	`7`	`**/`
`7`		`-staticintspiralOrder(intmatrix,intmatrixSize,intmatrixColSize,int*returnSize)`
	`8`	`+intspiralOrder(intmatrix,intmatrixSize,intmatrixColSize,int*returnSize)`
`8`	`9`	`{`
`9`	`10`	`if (matrixSize==0) {`
`10`	`11`	`*returnSize=0;`

Lines changed: 3 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,17 +5,12 @@ using namespace std;`
`5`	`5`	`classSolution {`
`6`	`6`	`public:`
`7`	`7`	`vector<int>spiralOrder(vector<vector<int>>& matrix) {`
`8`		`-if (matrix.empty()) {`
`9`		`-return vector<int>();`
`10`		`- }`
`11`		`-`
	`8`	`+ vector<int> res;`
`12`	`9`	`int hor_top =0;`
`13`		`-int hor_bottom = matrix.size();`
	`10`	`+int hor_bottom = matrix.size() -1;`
`14`	`11`	`int ver_left =0;`
`15`		`-int ver_right = matrix[0].size();`
	`12`	`+int ver_right = matrix[0].size() -1;`
`16`	`13`	`int direction =0;`
`17`		`- vector<int> res;`
`18`		`-`
`19`	`14`	`while (hor_top <= hor_bottom && ver_left <= ver_right) {`
`20`	`15`	`switch (direction) {`
`21`	`16`	`case0:`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`	`* The sizes of the arrays are returned as *returnColumnSizes array.`
`8`	`8`	`* Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().`
`9`	`9`	`*/`
`10`		`-staticint*generateMatrix(intn,intreturnSize,int**returnColumnSizes)`
	`10`	`+int*generateMatrix(intn,intreturnSize,int**returnColumnSizes)`
`11`	`11`	`{`
`12`	`12`	`inti;`
`13`	`13`	`int*matrix=malloc(nsizeof(int*));`

Lines changed: 47 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,47 @@`
	`1`	`+#include<bits/stdc++.h>`
	`2`	`+`
	`3`	`+usingnamespacestd;`
	`4`	`+`
	`5`	`+classSolution {`
	`6`	`+public:`
	`7`	`+ vector<vector<int>>generateMatrix(int n) {`
	`8`	`+ vector<vector<int>>matrix(n, vector<int>(n));`
	`9`	`+int direction =0;`
	`10`	`+int hor_top =0;`
	`11`	`+int hor_bottom = n -1;`
	`12`	`+int ver_left =0;`
	`13`	`+int ver_right = n -1;`
	`14`	`+int num =0;`
	`15`	`+while (num < n * n) {`
	`16`	`+switch (direction) {`
	`17`	`+case0:`
	`18`	`+for (int i = ver_left; i <= ver_right; i++) {`
	`19`	`+ matrix[hor_top][i] = ++num;`
	`20`	`+ }`
	`21`	`+ hor_top++;`
	`22`	`+break;`
	`23`	`+case1:`
	`24`	`+for (int i = hor_top; i <= hor_bottom; i++) {`
	`25`	`+ matrix[i][ver_right] = ++num;`
	`26`	`+ }`
	`27`	`+ ver_right--;`
	`28`	`+break;`
	`29`	`+case2:`
	`30`	`+for (int i = ver_right; i >= ver_left; i--) {`
	`31`	`+ matrix[hor_bottom][i] = ++num;`
	`32`	`+ }`
	`33`	`+ hor_bottom--;`
	`34`	`+break;`
	`35`	`+case3:`
	`36`	`+for (int i = hor_bottom; i >= hor_top; i--) {`
	`37`	`+ matrix[i][ver_left] = ++num;`
	`38`	`+ }`
	`39`	`+ ver_left++;`
	`40`	`+break;`
	`41`	`+ }`
	`42`	`+ direction++;`
	`43`	`+ direction %=4;`
	`44`	`+ }`
	`45`	`+return matrix;`
	`46`	`+ }`
	`47`	`+};`

Comments

(0)