update: 添加问题“3217.从链表中移除在数组中存在的节点”的代码和题解 (#1194)

3217: (CE+WA).cpp + AC.cpp (#1193)

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.commitmsg

@@ -1,9 +1 @@
-3289: AC.cpp+py+go+java | CE.rust + AC.rust (#1191)
-
-cpp - AC,29.70%,35.65%
-py - AC,100.00%,81.54%
-go - AC,100.00%,25.81%
-java - AC,44.37%,5.30%
-rust - 无语法检查 CE
-rust - AC,100.00%,45.45%
-cpp-O(1)空间 - AC,100.00%,74.75%
+3217: (CE+WA).cpp + AC.cpp (#1193)

Codes/3217-delete-nodes-from-linked-list-present-in-array.cpp

@@ -0,0 +1,38 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-11-01 21:45:28
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-11-01 21:54:03
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+// THIS IS NOT RIGHT
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode* modifiedList(vector<int>& nums, ListNode* now) {
+        unordered_set<int> se;
+        ListNode* head(0, now);
+        ListNode* last = head;
+        while (now) {
+            if (se.count(now->val)) {
+                now = now->next;
+                last->next = now;
+            } else {
+                last = now;
+                now = now->next;
+            }
+        }
+        return head->next;
+    }
+};

Codes/3217-delete-nodes-from-linked-list-present-in-array.go

@@ -0,0 +1,12 @@
+package main
+
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+func modifiedList(nums []int, head *ListNode) *ListNode {
+    
+}

Codes/3217-delete-nodes-from-linked-list-present-in-array.java

@@ -0,0 +1,15 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode modifiedList(int[] nums, ListNode head) {
+        
+    }
+}

Codes/3217-delete-nodes-from-linked-list-present-in-array.py

@@ -0,0 +1,10 @@
+from typing import List
+
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def modifiedList(self, nums: List[int], head: Optional[ListNode]) -> Optional[ListNode]:
+        

Codes/3217-delete-nodes-from-linked-list-present-in-array.rs

@@ -0,0 +1,21 @@
+// Definition for singly-linked list.
+// #[derive(PartialEq, Eq, Clone, Debug)]
+// pub struct ListNode {
+//   pub val: i32,
+//   pub next: Option<Box<ListNode>>
+// }
+// 
+// impl ListNode {
+//   #[inline]
+//   fn new(val: i32) -> Self {
+//     ListNode {
+//       next: None,
+//       val
+//     }
+//   }
+// }
+impl Solution {
+    pub fn modified_list(nums: Vec<i32>, head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        
+    }
+}

Codes/3217-delete-nodes-from-linked-list-present-in-array_AC.cpp

@@ -0,0 +1,38 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-11-01 21:53:51
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-11-01 21:54:45
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode* modifiedList(vector<int>& nums, ListNode* now) {
+        unordered_set<int> se(nums.begin(), nums.end());
+        ListNode* head = new ListNode(0, now);
+        ListNode* last = head;
+        while (now) {
+            if (se.count(now->val)) {
+                now = now->next;
+                last->next = now;
+            } else {
+                last = now;
+                now = now->next;
+            }
+        }
+        return head->next;
+    }
+};

Codes/3289-the-two-sneaky-numbers-of-digitville.rs

@@ -1,20 +1,20 @@
 /*
  * @Author: LetMeFly
- * @Date: 2025-10-31 22:19:33
+ * @Date: 2025-10-31 22:33:13
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-10-31 22:33:07
+ * @LastEditTime: 2025-10-31 22:39:35
  */
 use std::collections::HashSet;
-// THIS IS NOT RIGHT
+
 impl Solution {
     pub fn get_sneaky_numbers(nums: Vec<i32>) -> Vec<i32> {
         let mut se = HashSet::new();
         let mut ans = Vec::with_capacity(2);
-        for &t in nums {
-            if se.contains(t) {
-                ans.push(*t);
+        for t in nums {
+            if se.contains(&t) {
+                ans.push(t);
             } else {
-                se.inserst(t);
+                se.insert(t);
             }
         }
         ans

Codes/3289-the-two-sneaky-numbers-of-digitville_Right.rs

@@ -5,4 +5,4 @@
  * @LastEditTime: 2025-10-30 22:44:18
  */
 pub struct Solution;
-include!("3289-the-two-sneaky-numbers-of-digitville.rs");  // 这个fileName是会被脚本替换掉的
+include!("3217-delete-nodes-from-linked-list-present-in-array.rs");  // 这个fileName是会被脚本替换掉的