feat: add solutions to lc problem: No.3353 (#4787)

Author: yanglbme

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>) -> 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;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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>) -> 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;
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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;
+};

solution/3300-3399/3353.Minimum Total Operations/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn min_operations(nums: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        for i in 1..nums.len() {
+            if nums[i] != nums[i - 1] {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}