test: [20250824] Add (1493)

Author: actions-user

Cargo.toml

@@ -296,6 +296,7 @@ members = [
 	"problems/problems_1504",
 	"problems/problems_3195",
 	"problems/problems_3197",
+	"problems/problems_1493",
 ]
 
 [package]
@@ -614,3 +615,4 @@ solution_1277 = { path = "problems/problems_1277", features = ["solution_1277"]
 solution_1504 = { path = "problems/problems_1504", features = ["solution_1504"] }
 solution_3195 = { path = "problems/problems_3195", features = ["solution_3195"] }
 solution_3197 = { path = "problems/problems_3197", features = ["solution_3197"] }
+solution_1493 = { path = "problems/problems_1493", features = ["solution_1493"] }

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "3197",
+    "daily": "1493",
     "plans": ["3652", "problems", "3653", "problems", "3654", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_3197"
+	problem "leetCode/problems/problems_1493"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "3197", "problems", problem.Solve)
+	TestEach(t, "1493", "problems", problem.Solve)
 }

problems/problems_1493/Cargo.toml

@@ -0,0 +1,21 @@
+[package]
+name = "solution_1493"
+version = "0.1.0"
+edition = "2021"
+rust-version = "1.79.0"
+authors = ["benhao"]
+description = "LeetCode Solution 1493 in Rust"
+readme = "../../README.md"
+
+[features]
+solution_1493 = []
+
+[dependencies]
+serde_json = "1.0"
+rand = "0.8.4"
+regex = "1.10.5"
+library = { path = "../../rust/library", features = ["model"] }
+
+[lib]
+name = "solution_1493"
+path = "solution.rs"

problems/problems_1493/Solution.cpp

@@ -0,0 +1,28 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    int longestSubarray(vector<int>& nums) {
+        
+    }
+};
+
+json leetcode::qubh::Solve(string input_json_values) {
+	vector<string> inputArray;
+	size_t pos = input_json_values.find('\n');
+	while (pos != string::npos) {
+		inputArray.push_back(input_json_values.substr(0, pos));
+		input_json_values = input_json_values.substr(pos + 1);
+		pos = input_json_values.find('\n');
+	}
+	inputArray.push_back(input_json_values);
+
+	Solution solution;
+	vector<int> nums = json::parse(inputArray.at(0));
+	return solution.longestSubarray(nums);
+}

problems/problems_1493/Solution.java

@@ -0,0 +1,18 @@
+package problems.problems_1493;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int longestSubarray(int[] nums) {
+        
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        int[] nums = jsonArrayToIntArray(inputJsonValues[0]);
+        return JSON.toJSON(longestSubarray(nums));
+    }
+}

problems/problems_1493/problem.md

@@ -0,0 +1,38 @@
+# 1493. Longest Subarray of 1's After Deleting One Element [Rating: 1423.04]
+
+<p>Given a binary array <code>nums</code>, you should delete one element from it.</p>
+
+<p>Return <em>the size of the longest non-empty subarray containing only </em><code>1</code><em>&#39;s in the resulting array</em>. Return <code>0</code> if there is no such subarray.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,0,1]
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1&#39;s.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0,1,1,1,0,1,1,0,1]
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1&#39;s is [1,1,1,1,1].
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,1]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> You must delete one element.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li>
+</ul>

problems/problems_1493/problem_zh.md

@@ -0,0 +1,39 @@
+# 1493. 删掉一个元素以后全为 1 的最长子数组 [难度分: 1423.04]
+
+<p>给你一个二进制数组&nbsp;<code>nums</code>&nbsp;，你需要从中删掉一个元素。</p>
+
+<p>请你在删掉元素的结果数组中，返回最长的且只包含 1 的非空子数组的长度。</p>
+
+<p>如果不存在这样的子数组，请返回 0 。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>提示 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,1,0,1]
+<strong>输出：</strong>3
+<strong>解释：</strong>删掉位置 2 的数后，[1,1,1] 包含 3 个 1 。</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [0,1,1,1,0,1,1,0,1]
+<strong>输出：</strong>5
+<strong>解释：</strong>删掉位置 4 的数字后，[0,1,1,1,1,1,0,1] 的最长全 1 子数组为 [1,1,1,1,1] 。</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,1,1]
+<strong>输出：</strong>2
+<strong>解释：</strong>你必须要删除一个元素。</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>nums[i]</code>&nbsp;要么是&nbsp;<code>0</code>&nbsp;要么是&nbsp;<code>1</code> 。</li>
+</ul>

problems/problems_1493/solution.go

@@ -0,0 +1,22 @@
+package problem1493
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func longestSubarray(nums []int) int {
+    
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var nums []int
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &nums); err != nil {
+		log.Fatal(err)
+	}
+
+	return longestSubarray(nums)
+}

problems/problems_1493/solution.py

@@ -0,0 +1,11 @@
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.longestSubarray(test_input)
+
+    def longestSubarray(self, nums: List[int]) -> int:
+        pass
+