feat: add weekly contest 499

Author: yanglbme

solution/0300-0399/0396.Rotate Function/README.md

@@ -141,9 +141,7 @@ func maxRotateFunction(nums []int) int {
 	ans := f
 	for i := 1; i < n; i++ {
 		f = f + s - n*nums[n-i]
-		if ans < f {
-			ans = f
-		}
+		ans = max(ans, f)
 	}
 	return ans
 }

solution/0300-0399/0396.Rotate Function/README_EN.md

@@ -139,9 +139,7 @@ func maxRotateFunction(nums []int) int {
 	ans := f
 	for i := 1; i < n; i++ {
 		f = f + s - n*nums[n-i]
-		if ans < f {
-			ans = f
-		}
+		ans = max(ans, f)
 	}
 	return ans
 }

solution/0300-0399/0396.Rotate Function/Solution.go

@@ -7,9 +7,7 @@ func maxRotateFunction(nums []int) int {
 	ans := f
 	for i := 1; i < n; i++ {
 		f = f + s - n*nums[n-i]
-		if ans < f {
-			ans = f
-		}
+		ans = max(ans, f)
 	}
 	return ans
-}
+}

solution/3900-3999/3908.Valid Digit Number/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3908.Valid%20Digit%20Number/README.md
+rating: 1319
+source: 第 181 场双周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3900-3999/3908.Valid Digit Number/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3908.Valid%20Digit%20Number/README_EN.md
+rating: 1319
+source: Biweekly Contest 181 Q1
 ---
 
 <!-- problem:start -->

solution/3900-3999/3909.Compare Sums of Bitonic Parts/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3909.Compare%20Sums%20of%20Bitonic%20Parts/README.md
+rating: 1408
+source: 第 181 场双周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3900-3999/3909.Compare Sums of Bitonic Parts/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3909.Compare%20Sums%20of%20Bitonic%20Parts/README_EN.md
+rating: 1408
+source: Biweekly Contest 181 Q2
 ---
 
 <!-- problem:start -->

solution/3900-3999/3910.Count Connected Subgraphs with Even Node Sum/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3910.Count%20Connected%20Subgraphs%20with%20Even%20Node%20Sum/README.md
+rating: 1859
+source: 第 181 场双周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3900-3999/3910.Count Connected Subgraphs with Even Node Sum/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3910.Count%20Connected%20Subgraphs%20with%20Even%20Node%20Sum/README_EN.md
+rating: 1859
+source: Biweekly Contest 181 Q3
 ---
 
 <!-- problem:start -->

solution/3900-3999/3911.K-th Smallest Remaining Even Integer in Subarray Queries/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3911.K-th%20Smallest%20Remaining%20Even%20Integer%20in%20Subarray%20Queries/README.md
+rating: 2155
+source: 第 181 场双周赛 Q4
 ---
 
 <!-- problem:start -->