From 0540e831132d0327e34b8ae88882fa20f3e1d00f Mon Sep 17 00:00:00 2001
From: wu xiangkai <wuxiangkai@yonyou.com>
Date: Fri, 24 Oct 2025 12:24:03 +0800
Subject: [PATCH] =?UTF-8?q?feat:=202025-10-24=E6=89=93=E5=8D=A1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 725.split-linked-list-in-parts.java | 53 +++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 725.split-linked-list-in-parts.java

diff --git a/725.split-linked-list-in-parts.java b/725.split-linked-list-in-parts.java
new file mode 100644
index 0000000..efae89a
--- /dev/null
+++ b/725.split-linked-list-in-parts.java
@@ -0,0 +1,53 @@
+/*
+ * @lc app=leetcode id=725 lang=java
+ *
+ * [725] Split Linked List in Parts
+ */
+
+// @lc code=start
+/**
+ * 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[] splitListToParts(ListNode head, int k) {
+        int l = len(head);
+        int n = l / k, m = l % k, j = 0;
+        ListNode cur = head;
+        ListNode[] r = new ListNode[k];
+        for(int i = 0; i<k; i++) {
+            int p = n;
+            if(j < m) {
+                j++;
+                p++;
+            }
+            r[i] = cur;
+            if(p>0) {
+                for(int u = 0; u < p-1; u++) {
+                    cur = cur.next;
+                }
+                ListNode tmp = cur.next;
+                cur.next = null;
+                cur = tmp;
+            }
+        }
+        return r;
+    }
+
+    private int len(ListNode head) {
+        int r = 0;
+        while(head != null) {
+            r++;
+            head = head.next;
+        }
+        return r;
+    }
+}
+// @lc code=end
+