feat: add solutions to lc problem: No.0463

No.0463.Island Permeter

Author: yanglbme

.github/workflows/compress.yml

@@ -19,18 +19,23 @@ jobs:
         uses: actions/checkout@v2
 
       - name: Compress Images
-        uses: calibreapp/image-actions@master
+        id: calibre
+        uses: calibreapp/image-actions@main
         with:
           githubToken: ${{ secrets.GITHUB_TOKEN }}
           compressOnly: true
 
       - name: Commit Files
+        if: |
+          steps.calibre.outputs.markdown != ''
         run: |
           git config --local user.email "action@github.com"
           git config --local user.name "GitHub Action"
-          git commit -m "[Automated] Optimize images" -a
+          git commit -m "chore: auto compress images" -a
 
       - name: Push Changes
+        if: |
+          steps.calibre.outputs.markdown != ''
         uses: ad-m/github-push-action@master
         with:
           github_token: ${{ secrets.GITHUB_TOKEN }}

solution/0400-0499/0463.Island Perimeter/README.md

@@ -136,6 +136,54 @@ function islandPerimeter(grid: number[][]): number {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int islandPerimeter(vector<vector<int>>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        int ans = 0;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (grid[i][j] == 1)
+                {
+                    ans += 4;
+                    if (i < m - 1 && grid[i + 1][j] == 1) ans -= 2;
+                    if (j < n - 1 && grid[i][j + 1] == 1) ans -= 2;
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func islandPerimeter(grid [][]int) int {
+	m, n := len(grid), len(grid[0])
+	ans := 0
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			if grid[i][j] == 1 {
+				ans += 4
+				if i < m-1 && grid[i+1][j] == 1 {
+					ans -= 2
+				}
+				if j < n-1 && grid[i][j+1] == 1 {
+					ans -= 2
+				}
+			}
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0463.Island Perimeter/README_EN.md

@@ -123,6 +123,54 @@ function islandPerimeter(grid: number[][]): number {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int islandPerimeter(vector<vector<int>>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        int ans = 0;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (grid[i][j] == 1)
+                {
+                    ans += 4;
+                    if (i < m - 1 && grid[i + 1][j] == 1) ans -= 2;
+                    if (j < n - 1 && grid[i][j + 1] == 1) ans -= 2;
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func islandPerimeter(grid [][]int) int {
+	m, n := len(grid), len(grid[0])
+	ans := 0
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			if grid[i][j] == 1 {
+				ans += 4
+				if i < m-1 && grid[i+1][j] == 1 {
+					ans -= 2
+				}
+				if j < n-1 && grid[i][j+1] == 1 {
+					ans -= 2
+				}
+			}
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0400-0499/0463.Island Perimeter/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int islandPerimeter(vector<vector<int>>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        int ans = 0;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (grid[i][j] == 1)
+                {
+                    ans += 4;
+                    if (i < m - 1 && grid[i + 1][j] == 1) ans -= 2;
+                    if (j < n - 1 && grid[i][j + 1] == 1) ans -= 2;
+                }
+            }
+        }
+        return ans;
+    }
+};

solution/0400-0499/0463.Island Perimeter/Solution.go

@@ -0,0 +1,18 @@
+func islandPerimeter(grid [][]int) int {
+	m, n := len(grid), len(grid[0])
+	ans := 0
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			if grid[i][j] == 1 {
+				ans += 4
+				if i < m-1 && grid[i+1][j] == 1 {
+					ans -= 2
+				}
+				if j < n-1 && grid[i][j+1] == 1 {
+					ans -= 2
+				}
+			}
+		}
+	}
+	return ans
+}