feat: add solutions to lcci problem: No.16.11

No.16.11.Diving Board

Author: yanglbme

.github/workflows/starcharts.yml

@@ -15,4 +15,4 @@ jobs:
           github_token: ${{ secrets.GITHUB_TOKEN }}
           svg_path: images/starcharts.svg
           commit_message: "chore: update starcharts to leetcode project @doocs"
-          stars_change: "100"
+          stars_change: "50"

lcci/16.11.Diving Board/README.md

@@ -31,15 +31,72 @@ k = 3
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def divingBoard(self, shorter: int, longer: int, k: int) -> List[int]:
+        if k == 0:
+            return []
+        if longer == shorter:
+            return [longer * k]
+        ans = []
+        for i in range(k + 1):
+            ans.append(longer * i + shorter * (k - i))
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] divingBoard(int shorter, int longer, int k) {
+        if (k == 0) {
+            return new int[0];
+        }
+        if (longer == shorter) {
+            return new int[]{longer * k};
+        }
+        int[] ans = new int[k + 1];
+        for (int i = 0; i < k + 1; ++i) {
+            ans[i] = longer * i + shorter * (k - i);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> divingBoard(int shorter, int longer, int k) {
+        if (k == 0) return {};
+        if (longer == shorter) return {longer * k};
+        vector<int> ans;
+        for (int i = 0; i < k + 1; ++i)
+            ans.push_back(longer * i + shorter * (k - i));
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func divingBoard(shorter int, longer int, k int) []int {
+	if k == 0 {
+		return []int{}
+	}
+	if longer == shorter {
+		return []int{longer * k}
+	}
+	var ans []int
+	for i := 0; i < k+1; i++ {
+		ans = append(ans, longer*i+shorter*(k-i))
+	}
+	return ans
+}
 ```
 
 ### **...**

lcci/16.11.Diving Board/README_EN.md

@@ -38,13 +38,70 @@ k = 3
 ### **Python3**
 
 ```python
-
+class Solution:
+    def divingBoard(self, shorter: int, longer: int, k: int) -> List[int]:
+        if k == 0:
+            return []
+        if longer == shorter:
+            return [longer * k]
+        ans = []
+        for i in range(k + 1):
+            ans.append(longer * i + shorter * (k - i))
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] divingBoard(int shorter, int longer, int k) {
+        if (k == 0) {
+            return new int[0];
+        }
+        if (longer == shorter) {
+            return new int[]{longer * k};
+        }
+        int[] ans = new int[k + 1];
+        for (int i = 0; i < k + 1; ++i) {
+            ans[i] = longer * i + shorter * (k - i);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> divingBoard(int shorter, int longer, int k) {
+        if (k == 0) return {};
+        if (longer == shorter) return {longer * k};
+        vector<int> ans;
+        for (int i = 0; i < k + 1; ++i)
+            ans.push_back(longer * i + shorter * (k - i));
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func divingBoard(shorter int, longer int, k int) []int {
+	if k == 0 {
+		return []int{}
+	}
+	if longer == shorter {
+		return []int{longer * k}
+	}
+	var ans []int
+	for i := 0; i < k+1; i++ {
+		ans = append(ans, longer*i+shorter*(k-i))
+	}
+	return ans
+}
 ```
 
 ### **...**

lcci/16.11.Diving Board/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    vector<int> divingBoard(int shorter, int longer, int k) {
+        if (k == 0) return {};
+        if (longer == shorter) return {longer * k};
+        vector<int> ans;
+        for (int i = 0; i < k + 1; ++i)
+            ans.push_back(longer * i + shorter * (k - i));
+        return ans;
+    }
+};

lcci/16.11.Diving Board/Solution.go

@@ -0,0 +1,13 @@
+func divingBoard(shorter int, longer int, k int) []int {
+	if k == 0 {
+		return []int{}
+	}
+	if longer == shorter {
+		return []int{longer * k}
+	}
+	var ans []int
+	for i := 0; i < k+1; i++ {
+		ans = append(ans, longer*i+shorter*(k-i))
+	}
+	return ans
+}

lcci/16.11.Diving Board/Solution.java

@@ -7,7 +7,7 @@ public int[] divingBoard(int shorter, int longer, int k) {
             return new int[]{longer * k};
         }
         int[] ans = new int[k + 1];
-        for (int i = 0;i <= k;i++) {
+        for (int i = 0; i < k + 1; ++i) {
             ans[i] = longer * i + shorter * (k - i);
         }
         return ans;

lcci/16.11.Diving Board/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def divingBoard(self, shorter: int, longer: int, k: int) -> List[int]:
+        if k == 0:
+            return []
+        if longer == shorter:
+            return [longer * k]
+        ans = []
+        for i in range(k + 1):
+            ans.append(longer * i + shorter * (k - i))
+        return ans

solution/main.py

@@ -5,9 +5,9 @@
 from urllib.parse import quote
 
 import requests
-import requests.packages.urllib3
+import urllib3
 
-requests.packages.urllib3.disable_warnings()
+urllib3.disable_warnings()
 
 
 class LCSpider: