algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-26 21:46:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #60 from halfrost/code_quality_improvement

Browse Source 
optimization code quality level from A to A+
This commit is contained in:
halfrost
2020-08-27 01:07:57 +08:00
committed by YDZ
parent 7b7307761c 96c36de45b
commit d2dfc2d634
543 changed files with 2449 additions and 2396 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts.go
View File

@ -27,9 +27,8 @@ func splitListToParts(root *ListNode, k int) []*ListNode {
length := getLength(root)
splitNum := length / k
lengNum := length % k
cur := root
head := root
pre := root
cur, head := root, root
var pre *ListNode
fmt.Printf("总长度 %v, 分 %v 组, 前面 %v 组长度为 %v, 剩余 %v 组，每组 %v\n", length, k, lengNum, splitNum+1, k-lengNum, splitNum)
if splitNum == 0 {
for i := 0; i < k; i++ {

16
leetcode/0725.Split-Linked-List-in-Parts/725. Split Linked List in Parts_test.go
View File

@ -29,42 +29,42 @@ func Test_Problem725(t *testing.T) {
qs := []question725{
question725{
{
para725{[]int{1, 2, 3, 4, 5}, 7},
ans725{[]int{1, 2, 3, 4, 5, 0, 0}},
},
question725{
{
para725{[]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, 3},
ans725{[]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}},
},
question725{
{
para725{[]int{1, 1, 1, 1, 1}, 1},
ans725{[]int{1, 1, 1, 1, 1}},
},
question725{
{
para725{[]int{}, 3},
ans725{[]int{}},
},
question725{
{
para725{[]int{1, 2, 3, 4, 5}, 5},
ans725{[]int{1, 2, 3, 4}},
},
question725{
{
para725{[]int{}, 5},
ans725{[]int{}},
},
question725{
{
para725{[]int{1, 2, 3, 4, 5}, 10},
ans725{[]int{1, 2, 3, 4, 5}},
},
question725{
{
para725{[]int{1}, 1},
ans725{[]int{}},
},