diff --git a/solution/3300-3399/3353.Minimum Total Operations/README.md b/solution/3300-3399/3353.Minimum Total Operations/README.md index 9b0d0b92783ea..8883559dc115d 100644 --- a/solution/3300-3399/3353.Minimum Total Operations/README.md +++ b/solution/3300-3399/3353.Minimum Total Operations/README.md @@ -146,6 +146,38 @@ function minOperations(nums: number[]): number { } ``` +#### Rust + +```rust +impl Solution { + pub fn min_operations(nums: Vec) -> i32 { + let mut ans = 0; + for i in 1..nums.len() { + if nums[i] != nums[i - 1] { + ans += 1; + } + } + ans + } +} +``` + +#### JavaScript + +```js +/** + * @param {number[]} nums + * @return {number} + */ +var minOperations = function (nums) { + let ans = 0; + for (let i = 1; i < nums.length; ++i) { + ans += nums[i] !== nums[i - 1] ? 1 : 0; + } + return ans; +}; +``` + diff --git a/solution/3300-3399/3353.Minimum Total Operations/README_EN.md b/solution/3300-3399/3353.Minimum Total Operations/README_EN.md index 1d930dc5a18cd..749075afd8ceb 100644 --- a/solution/3300-3399/3353.Minimum Total Operations/README_EN.md +++ b/solution/3300-3399/3353.Minimum Total Operations/README_EN.md @@ -144,6 +144,38 @@ function minOperations(nums: number[]): number { } ``` +#### Rust + +```rust +impl Solution { + pub fn min_operations(nums: Vec) -> i32 { + let mut ans = 0; + for i in 1..nums.len() { + if nums[i] != nums[i - 1] { + ans += 1; + } + } + ans + } +} +``` + +#### JavaScript + +```js +/** + * @param {number[]} nums + * @return {number} + */ +var minOperations = function (nums) { + let ans = 0; + for (let i = 1; i < nums.length; ++i) { + ans += nums[i] !== nums[i - 1] ? 1 : 0; + } + return ans; +}; +``` + diff --git a/solution/3300-3399/3353.Minimum Total Operations/Solution.js b/solution/3300-3399/3353.Minimum Total Operations/Solution.js new file mode 100644 index 0000000000000..907efe7853c56 --- /dev/null +++ b/solution/3300-3399/3353.Minimum Total Operations/Solution.js @@ -0,0 +1,11 @@ +/** + * @param {number[]} nums + * @return {number} + */ +var minOperations = function (nums) { + let ans = 0; + for (let i = 1; i < nums.length; ++i) { + ans += nums[i] !== nums[i - 1] ? 1 : 0; + } + return ans; +}; diff --git a/solution/3300-3399/3353.Minimum Total Operations/Solution.rs b/solution/3300-3399/3353.Minimum Total Operations/Solution.rs new file mode 100644 index 0000000000000..138585fea6759 --- /dev/null +++ b/solution/3300-3399/3353.Minimum Total Operations/Solution.rs @@ -0,0 +1,11 @@ +impl Solution { + pub fn min_operations(nums: Vec) -> i32 { + let mut ans = 0; + for i in 1..nums.len() { + if nums[i] != nums[i - 1] { + ans += 1; + } + } + ans + } +}