add: Surrounded Regions

Author: hijiangtao

README.md

@@ -27,6 +27,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/) | [JavaScript](./src/sqrtx/res.js)|Easy|
 |73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [JavaScript](./src/set-matrix-zeroes/res.js)|Medium|
 |75|[Sort Colors](https://leetcode.com/problems/sort-colors/) | [JavaScript](./src/sort-colors/res.js)|Medium|
+|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | [JavaScript](./src/surrounded-regions/res.js)|Medium|
 |136|[Single Number](https://leetcode.com/problems/single-number/) | [JavaScript](./src/single-number/res.js)|Easy|
 |175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)| [SQL](./src/combine-two-tables/res.txt)|Easy|
 |176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/)| [SQL](./src/second-highest-salary/res.txt)|Easy|

src/surrounded-regions/res.js

@@ -0,0 +1,103 @@
+/**
+ * res.js
+ * @authors Joe Jiang (hijiangtao@gmail.com)
+ * @date    2017-03-10 22:17:27
+ * @version $Id$
+ *
+ * @param {character[][]} board
+ * @return {void} Do not return anything, modify board in-place instead.
+ */
+
+let solve = function(board) {
+    if (board.length === 0) {
+        return ;
+    }
+    
+    let rowlen = board.length,
+        collen = board[0].length,
+        rowecp = rowlen-1,
+        colecp = collen-1;
+
+    if (rowlen <= 2 || collen <= 2) {
+    	return ;
+    }
+        
+    for (let i=0; i<collen; i++) {
+        // 判断第一行是否存在'O'
+        if (board[0][i] === 'O') {
+        	board[0][i] = '1';
+        	if (board[1][i] === 'O' && i!==0 && i!==collen-1) {
+        		judZero(1, i, rowlen, collen, board);
+        	}
+        }
+        // judZero(0, i, rowlen, collen, board);
+        
+        // 判断最后一行是否存在'O'
+        if (board[rowecp][i] === 'O') {
+        	board[rowecp][i] = '1';
+        	if (board[rowecp-1][i] === 'O' && i!==0 && i!==collen-1) {
+        		judZero(rowecp-1, i, rowlen, collen, board);
+        	}
+        }
+
+        // judZero(rowecp, i, rowlen, collen, board);
+    }
+    
+    
+    for (let i=1; i<rowecp; i++) {
+        // 判断第一列是否存在'O'
+        if (board[i][0] === 'O') {
+        	board[i][0] = '1';
+        	if (board[i][1] === 'O' && i!==0 && i!==rowecp) {
+        		judZero(i, 1, rowlen, collen, board);
+        	}
+        }
+
+        // judZero(i, 0, rowlen, collen, board);
+        
+        // 判断最后一列是否存在'O'
+        if (board[i][colecp] === 'O') {
+        	board[i][colecp] = '1';
+        	if (board[i][colecp-1] === 'O' && i!==0 && i!==rowecp) {
+        		judZero(i, colecp-1, rowlen, collen, board);
+        	}
+        }
+
+        // judZero(i, colecp, rowlen, collen, board);
+    }
+    
+    for (let i=0; i<rowlen; i++) {
+        for (let j=0; j<collen; j++) {
+            if (board[i][j] === '1') {
+                board[i][j] = 'O';
+            } else if (board[i][j] === 'O') {
+                board[i][j] = 'X';
+            }
+        }
+    }
+    
+    return ;
+};
+
+let judZero = function(x, y, rowlen, collen, matrix) {
+    // if (matrix[x][y] !== 'O') {
+    //     return ;
+    // }
+    
+    matrix[x][y] = '1';
+    
+    if (x-1 > 1 && matrix[x-1][y] === 'O') {
+        judZero(x-1, y, rowlen, collen, matrix);
+    }
+    if (x+1 < rowlen-2 && matrix[x+1][y] === 'O') {
+        judZero(x+1, y, rowlen, collen, matrix);
+    }
+    if (y-1 > 1 && matrix[x][y-1] === 'O') {
+        judZero(x, y-1, rowlen, collen, matrix);
+    }
+    if (y+1 < collen-2 && matrix[x][y+1] === 'O') {
+        judZero(x, y+1, rowlen, collen, matrix);
+    }
+};
+
+

src/surrounded-regions/res.py

@@ -0,0 +1,51 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+# @Date    : 2017-03-10 22:33:36
+# @Author  : Joe Jiang (hijiangtao@gmail.com)
+# @Link    : https://hijiangtao.github.io/
+# @Version : $Id$
+
+class Solution(object):
+    def solve(self, board):
+        """
+        :type board: List[List[str]]
+        :rtype: void Do not return anything, modify board in-place instead.
+        """
+        
+        if len(board) == 0:
+        	return 0
+
+        rowlen = len(board)
+        collen = len(board[0])
+        rowecp = rowlen-1
+        colecp = collen-1
+
+        for i in xrange(0,collen):
+        	self.judZero(0, i, rowlen, collen, board)
+        	self.judZero(rowecp, i, rowlen, collen, board)
+
+        for i in xrange(1,rowecp):
+        	self.judZero(i, 0, rowlen, collen, board)
+        	self.judZero(i, colecp, rowlen, collen, board)
+
+        for x in xrange(0,rowlen):
+        	for y in xrange(0,collen):
+        		if board[x][y] == '1':
+        			board[x][y] = 'O'
+        		if board[x][y] == 'O':
+        			board[x][y] = 'X'
+
+    def judZero(self, x, y, rowlen, collen, matrix):
+    	if matrix[x][y] !== 'O':
+        	return 0	
+
+        matrix[x][y] = '1'
+
+        if x-1 >= 0:
+        	self.judZero(x-1, y, rowlen, collen, matrix)
+	    if x+1 < rowlen:
+        	self.judZero(x+1, y, rowlen, collen, matrix)
+	    if y-1 >= 0:
+        	self.judZero(x, y-1, rowlen, collen, matrix)
+        if y+1 < collen:
+        	self.judZero(x, y+1, rowlen, collen, matrix)