Skip to content

feat: add solutions to lc problem: No.1493 #4661

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 24, 2025
+225 −12
Merged

feat: add solutions to lc problem: No.1493 #4661

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
82 changes: 79 additions & 3 deletions ...ion/1400-1499/1493.Longest Subarray of 1's After Deleting One Element/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -197,6 +197,37 @@ function longestSubarray(nums: number[]): number {
}
```

#### Rust

```rust
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let n = nums.len();
let mut left = vec![0; n + 1];
let mut right = vec![0; n + 1];

for i in 1..=n {
if nums[i - 1] == 1 {
left[i] = left[i - 1] + 1;
}
}

for i in (0..n).rev() {
if nums[i] == 1 {
right[i] = right[i + 1] + 1;
}
}

let mut ans = 0;
for i in 0..n {
ans = ans.max(left[i] + right[i + 1]);
}

ans as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down Expand Up @@ -300,6 +331,30 @@ function longestSubarray(nums: number[]): number {
}
```

#### Rust

```rust
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let n = nums.len();
let mut ans = 0;
let mut j = 0;
let mut cnt = 0;

for i in 0..n {
cnt += nums[i] ^ 1;
while cnt > 1 {
cnt -= nums[j] ^ 1;
j += 1;
}
ans = ans.max(i - j);
}

ans as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down Expand Up @@ -335,7 +390,7 @@ class Solution:
```java
class Solution {
public int longestSubarray(int[] nums) {
int ans = 0, cnt = 0, l = 0;
int cnt = 0, l = 0;
for (int x : nums) {
cnt += x ^ 1;
if (cnt > 1) {
Expand All @@ -353,7 +408,7 @@ class Solution {
class Solution {
public:
int longestSubarray(vector<int>& nums) {
int ans = 0, cnt = 0, l = 0;
int cnt = 0, l = 0;
for (int x : nums) {
cnt += x ^ 1;
if (cnt > 1) {
Expand All @@ -368,7 +423,7 @@ public:
#### Go

```go
func longestSubarray(nums []int) (ans int) {
func longestSubarray(nums []int) int {
cnt, l := 0, 0
for _, x := range nums {
cnt += x ^ 1
Expand Down Expand Up @@ -396,6 +451,27 @@ function longestSubarray(nums: number[]): number {
}
```

#### Rust

```rust
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let mut cnt = 0;
let mut l = 0;

for &x in &nums {
cnt += x ^ 1;
if cnt > 1 {
cnt -= nums[l] ^ 1;
l += 1;
}
}

(nums.len() - l - 1) as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
82 changes: 79 additions & 3 deletions .../1400-1499/1493.Longest Subarray of 1's After Deleting One Element/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -196,6 +196,37 @@ function longestSubarray(nums: number[]): number {
}
```

#### Rust

```rust
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let n = nums.len();
let mut left = vec![0; n + 1];
let mut right = vec![0; n + 1];

for i in 1..=n {
if nums[i - 1] == 1 {
left[i] = left[i - 1] + 1;
}
}

for i in (0..n).rev() {
if nums[i] == 1 {
right[i] = right[i + 1] + 1;
}
}

let mut ans = 0;
for i in 0..n {
ans = ans.max(left[i] + right[i + 1]);
}

ans as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down Expand Up @@ -299,6 +330,30 @@ function longestSubarray(nums: number[]): number {
}
```

#### Rust

```rust
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let n = nums.len();
let mut ans = 0;
let mut j = 0;
let mut cnt = 0;

for i in 0..n {
cnt += nums[i] ^ 1;
while cnt > 1 {
cnt -= nums[j] ^ 1;
j += 1;
}
ans = ans.max(i - j);
}

ans as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down Expand Up @@ -334,7 +389,7 @@ class Solution:
```java
class Solution {
public int longestSubarray(int[] nums) {
int ans = 0, cnt = 0, l = 0;
int cnt = 0, l = 0;
for (int x : nums) {
cnt += x ^ 1;
if (cnt > 1) {
Expand All @@ -352,7 +407,7 @@ class Solution {
class Solution {
public:
int longestSubarray(vector<int>& nums) {
int ans = 0, cnt = 0, l = 0;
int cnt = 0, l = 0;
for (int x : nums) {
cnt += x ^ 1;
if (cnt > 1) {
Expand All @@ -367,7 +422,7 @@ public:
#### Go

```go
func longestSubarray(nums []int) (ans int) {
func longestSubarray(nums []int) int {
cnt, l := 0, 0
for _, x := range nums {
cnt += x ^ 1
Expand Down Expand Up @@ -395,6 +450,27 @@ function longestSubarray(nums: number[]): number {
}
```

#### Rust

```rust
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let mut cnt = 0;
let mut l = 0;

for &x in &nums {
cnt += x ^ 1;
if cnt > 1 {
cnt -= nums[l] ^ 1;
l += 1;
}
}

(nums.len() - l - 1) as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
26 changes: 26 additions & 0 deletions solution/1400-1499/1493.Longest Subarray of 1's After Deleting One Element/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let n = nums.len();
let mut left = vec![0; n + 1];
let mut right = vec![0; n + 1];

for i in 1..=n {
if nums[i - 1] == 1 {
left[i] = left[i - 1] + 1;
}
}

for i in (0..n).rev() {
if nums[i] == 1 {
right[i] = right[i + 1] + 1;
}
}

let mut ans = 0;
for i in 0..n {
ans = ans.max(left[i] + right[i + 1]);
}

ans as i32
}
}
19 changes: 19 additions & 0 deletions solution/1400-1499/1493.Longest Subarray of 1's After Deleting One Element/Solution2.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let n = nums.len();
let mut ans = 0;
let mut j = 0;
let mut cnt = 0;

for i in 0..n {
cnt += nums[i] ^ 1;
while cnt > 1 {
cnt -= nums[j] ^ 1;
j += 1;
}
ans = ans.max(i - j);
}

ans as i32
}
}
4 changes: 2 additions & 2 deletions solution/1400-1499/1493.Longest Subarray of 1's After Deleting One Element/Solution3.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
class Solution {
public:
int longestSubarray(vector<int>& nums) {
int ans = 0, cnt = 0, l = 0;
int cnt = 0, l = 0;
for (int x : nums) {
cnt += x ^ 1;
if (cnt > 1) {
Expand All @@ -10,4 +10,4 @@ class Solution {
}
return nums.size() - l - 1;
}
};
};
4 changes: 2 additions & 2 deletions solution/1400-1499/1493.Longest Subarray of 1's After Deleting One Element/Solution3.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
func longestSubarray(nums []int) (ans int) {
func longestSubarray(nums []int) int {
cnt, l := 0, 0
for _, x := range nums {
cnt += x ^ 1
Expand All @@ -8,4 +8,4 @@ func longestSubarray(nums []int) (ans int) {
}
}
return len(nums) - l - 1
}
}
4 changes: 2 additions & 2 deletions solution/1400-1499/1493.Longest Subarray of 1's After Deleting One Element/Solution3.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
class Solution {
public int longestSubarray(int[] nums) {
int ans = 0, cnt = 0, l = 0;
int cnt = 0, l = 0;
for (int x : nums) {
cnt += x ^ 1;
if (cnt > 1) {
Expand All @@ -9,4 +9,4 @@ public int longestSubarray(int[] nums) {
}
return nums.length - l - 1;
}
}
}
16 changes: 16 additions & 0 deletions solution/1400-1499/1493.Longest Subarray of 1's After Deleting One Element/Solution3.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
impl Solution {
pub fn longest_subarray(nums: Vec<i32>) -> i32 {
let mut cnt = 0;
let mut l = 0;

for &x in &nums {
cnt += x ^ 1;
if cnt > 1 {
cnt -= nums[l] ^ 1;
l += 1;
}
}

(nums.len() - l - 1) as i32
}
}