feat: add solutions to lc problem: No.0147

[taoyq1988]

No.0147.Insertion Sort List

[Copilot]

Pull Request Overview

This PR adds a Go solution for LeetCode problem No.0147 (Insertion Sort List) and updates the language-agnostic READMEs to include the new Go implementation.

• Introduced insertionSortList in Go under the problem folder.
• Added Go code snippets to both README_EN.md and README.md.

Reviewed Changes

Copilot reviewed 3 out of 3 changed files in this pull request and generated 1 comment.

File	Description
solution/0100-0199/0147.Insertion Sort List/Solution.go	New Go implementation of insertionSortList.
solution/0100-0199/0147.Insertion Sort List/README_EN.md	Added Go code example.
solution/0100-0199/0147.Insertion Sort List/README.md	Added Go code example.

Comments suppressed due to low confidence (4)

solution/0100-0199/0147.Insertion Sort List/Solution.go:13

• [nitpick] The variable name pre is ambiguous. Consider renaming it to something like lastSorted or sortedTail to clarify its role.

pre, cur := dummy, head

solution/0100-0199/0147.Insertion Sort List/Solution.go:20

• [nitpick] The loop pointer p could be renamed to insertPos or prevNode for clearer intent.

p := dummy

solution/0100-0199/0147.Insertion Sort List/Solution.go:24

• [nitpick] The temporary variable t is non-descriptive. Consider renaming it to nextUnsorted or nextTemp.

t := cur.Next

solution/0100-0199/0147.Insertion Sort List/Solution.go:8

• There are no accompanying unit tests for this function. Please add tests covering edge cases such as an empty list, single-node list, reversed list, and lists with duplicate values.

func insertionSortList(head *ListNode) *ListNode {