feat: add solutions to lc problem: No.1262 (#866)

No.1262.Greatest Sum Divisible by Three

Author: hongyiheng

solution/1200-1299/1262.Greatest Sum Divisible by Three/README.md

@@ -53,15 +53,34 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maxSumDivThree(self, nums: List[int]) -> int:
+        dp = [0] * 3
+        for v in nums:
+            a, b, c = dp[0] + v, dp[1] + v, dp[2] + v
+            dp[a % 3] = max(dp[a % 3], a)
+            dp[b % 3] = max(dp[b % 3], b)
+            dp[c % 3] = max(dp[c % 3], c)
+        return dp[0]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int maxSumDivThree(int[] nums) {
+        int[] dp = new int[3];
+        for (int v : nums) {
+            int a = dp[0] + v, b = dp[1] + v, c = dp[2] + v;
+            dp[a % 3] = Math.max(dp[a % 3], a);
+            dp[b % 3] = Math.max(dp[b % 3], b);
+            dp[c % 3] = Math.max(dp[c % 3], c);
+        }
+        return dp[0];
+    }
+}
 ```
 
 ### **...**

solution/1200-1299/1262.Greatest Sum Divisible by Three/README_EN.md

@@ -45,13 +45,32 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def maxSumDivThree(self, nums: List[int]) -> int:
+        dp = [0] * 3
+        for v in nums:
+            a, b, c = dp[0] + v, dp[1] + v, dp[2] + v
+            dp[a % 3] = max(dp[a % 3], a)
+            dp[b % 3] = max(dp[b % 3], b)
+            dp[c % 3] = max(dp[c % 3], c)
+        return dp[0]
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int maxSumDivThree(int[] nums) {
+        int[] dp = new int[3];
+        for (int v : nums) {
+            int a = dp[0] + v, b = dp[1] + v, c = dp[2] + v;
+            dp[a % 3] = Math.max(dp[a % 3], a);
+            dp[b % 3] = Math.max(dp[b % 3], b);
+            dp[c % 3] = Math.max(dp[c % 3], c);
+        }
+        return dp[0];
+    }
+}
 ```
 
 ### **...**

solution/1200-1299/1262.Greatest Sum Divisible by Three/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int maxSumDivThree(int[] nums) {
+        int[] dp = new int[3];
+        for (int v : nums) {
+            int a = dp[0] + v, b = dp[1] + v, c = dp[2] + v;
+            dp[a % 3] = Math.max(dp[a % 3], a);
+            dp[b % 3] = Math.max(dp[b % 3], b);
+            dp[c % 3] = Math.max(dp[c % 3], c);
+        }
+        return dp[0];
+    }
+}

solution/1200-1299/1262.Greatest Sum Divisible by Three/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def maxSumDivThree(self, nums: List[int]) -> int:
+        dp = [0] * 3
+        for v in nums:
+            a, b, c = dp[0] + v, dp[1] + v, dp[2] + v
+            dp[a % 3] = max(dp[a % 3], a)
+            dp[b % 3] = max(dp[b % 3], b)
+            dp[c % 3] = max(dp[c % 3], c)
+        return dp[0]