add 1474

fishercoder1534 · fishercoder1534 · commit bb2c5dc6b2a3 · 2021-01-05T16:29:35.000-08:00
diff --git a/README.md b/README.md
@@ -94,6 +94,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](../master/cpp/_1480.cpp)| |Easy|Array|
 |1476|[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Medium|Array|
 |1475|[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) | |Easy|Array|
+|1474|[Delete N Nodes After M Nodes of a Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1474.java) | |Easy|LinkedList|
 |1471|[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | |Medium|Array, Sort|
 |1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](../master/cpp/_1470.cpp) | |Easy|Array|
 |1469|[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1469.java) | |Easy|Tree, DFS|
diff --git a/src/main/java/com/fishercoder/solutions/_1474.java b/src/main/java/com/fishercoder/solutions/_1474.java
@@ -0,0 +1,25 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.ListNode;
+
+public class _1474 {
+    public static class Solution1 {
+        public ListNode deleteNodes(ListNode head, int m, int n) {
+            ListNode pre = new ListNode(-1);
+            ListNode tmp = pre;
+            while (head != null) {
+                int mCount = m;
+                while (head != null && mCount-- > 0) {
+                    tmp.next = new ListNode(head.val);
+                    head = head.next;
+                    tmp = tmp.next;
+                }
+                int nCount = n;
+                while (head != null && nCount-- > 0) {
+                    head = head.next;
+                }
+            }
+            return pre.next;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1474Test.java b/src/test/java/com/fishercoder/_1474Test.java
@@ -0,0 +1,33 @@
+package com.fishercoder;
+
+import com.fishercoder.common.classes.ListNode;
+import com.fishercoder.common.utils.LinkedListUtils;
+import com.fishercoder.solutions._1474;
+import com.fishercoder.solutions._206;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1474Test {
+    private static _1474.Solution1 solution1;
+    private static ListNode head;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1474.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        head = LinkedListUtils.contructLinkedList(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13});
+        assertEquals(LinkedListUtils.contructLinkedList(new int[]{1, 2, 6, 7, 11, 12}), solution1.deleteNodes(head, 2, 3));
+    }
+
+    @Test
+    public void test2() {
+        head = LinkedListUtils.contructLinkedList(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11});
+        assertEquals(LinkedListUtils.contructLinkedList(new int[]{1, 5, 9}), solution1.deleteNodes(head, 1, 3));
+    }
+
+}
