feat: add solutions to lc problem: No.0463.Island Perimeter

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

@@ -62,15 +62,47 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def islandPerimeter(self, grid: List[List[int]]) -> int:
+        m, n = len(grid), len(grid[0])
+        ans = 0
+        for i in range(m):
+            for j in range(n):
+                if grid[i][j] == 1:
+                    ans += 4
+                    if i < m - 1 and grid[i + 1][j] == 1:
+                        ans -= 2
+                    if j < n -1 and grid[i][j + 1] == 1:
+                        ans -= 2
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int islandPerimeter(int[][] grid) {
+        int ans = 0;
+        int m = grid.length;
+        int n = grid[0].length;
+        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;
+    }
+}
 ```
 
 ### **TypeScript**

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

@@ -51,13 +51,45 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def islandPerimeter(self, grid: List[List[int]]) -> int:
+        m, n = len(grid), len(grid[0])
+        ans = 0
+        for i in range(m):
+            for j in range(n):
+                if grid[i][j] == 1:
+                    ans += 4
+                    if i < m - 1 and grid[i + 1][j] == 1:
+                        ans -= 2
+                    if j < n -1 and grid[i][j + 1] == 1:
+                        ans -= 2
+        return ans
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int islandPerimeter(int[][] grid) {
+        int ans = 0;
+        int m = grid.length;
+        int n = grid[0].length;
+        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;
+    }
+}
 ```
 
 ### **TypeScript**

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

@@ -0,0 +1,21 @@
+class Solution {
+    public int islandPerimeter(int[][] grid) {
+        int ans = 0;
+        int m = grid.length;
+        int n = grid[0].length;
+        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.py

@@ -0,0 +1,13 @@
+class Solution:
+    def islandPerimeter(self, grid: List[List[int]]) -> int:
+        m, n = len(grid), len(grid[0])
+        ans = 0
+        for i in range(m):
+            for j in range(n):
+                if grid[i][j] == 1:
+                    ans += 4
+                    if i < m - 1 and grid[i + 1][j] == 1:
+                        ans -= 2
+                    if j < n -1 and grid[i][j + 1] == 1:
+                        ans -= 2
+        return ans