fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Change the operations sequence of the likedlist's insert() method.

Browse Source
This commit is contained in:
krahets 2023-02-27 20:25:43 +08:00
parent 18f2ec4fdc
commit 9ea24e8b26
11 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
codes/c/chapter_array_and_linkedlist/linked_list.c
View File

@ -9,8 +9,8 @@
/* 在链表的结点 n0 之后插入结点 P */
void insert(ListNode* n0, ListNode* P) {
ListNode *n1 = n0->next;
n0->next = P;
P->next = n1;
n0->next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/cpp/chapter_array_and_linkedlist/linked_list.cpp
View File

@ -9,8 +9,8 @@
/* 在链表的结点 n0 之后插入结点 P */
void insert(ListNode* n0, ListNode* P) {
ListNode* n1 = n0->next;
n0->next = P;
P->next = n1;
n0->next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/csharp/chapter_array_and_linkedlist/linked_list.cs
View File

@ -13,8 +13,8 @@ public class linked_list
public static void insert(ListNode n0, ListNode P)
{
ListNode? n1 = n0.next;
n0.next = P;
P.next = n1;
n0.next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/dart/chapter_array_and_linkedlist/linked_list.dart
View File

@ -12,8 +12,8 @@ class LinkedList {
/* 在链表的结点 n0 之后插入结点 P */
void insert(ListNode n0, ListNode P) {
ListNode? n1 = n0.next;
n0.next = P;
P.next = n1;
n0.next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/go/chapter_array_and_linkedlist/linked_list.go
View File

@ -11,8 +11,8 @@ import (
/* 在链表的结点 n0 之后插入结点 P */
func insertNode(n0 *ListNode, P *ListNode) {
n1 := n0.Next
n0.Next = P
P.Next = n1
n0.Next = P
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/java/chapter_array_and_linkedlist/linked_list.java
View File

@ -12,8 +12,8 @@ public class linked_list {
/* 在链表的结点 n0 之后插入结点 P */
static void insert(ListNode n0, ListNode P) {
ListNode n1 = n0.next;
n0.next = P;
P.next = n1;
n0.next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/javascript/chapter_array_and_linkedlist/linked_list.js
View File

@ -10,8 +10,8 @@ const { ListNode } = require("../include/ListNode");
/* 在链表的结点 n0 之后插入结点 P */
function insert(n0, P) {
const n1 = n0.next;
n0.next = P;
P.next = n1;
n0.next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/python/chapter_array_and_linkedlist/linked_list.py
View File

@ -11,8 +11,8 @@ from include import *
""" 在链表的结点 n0 之后插入结点 P """
def insert(n0, P):
n1 = n0.next
n0.next = P
P.next = n1
n0.next = P
""" 删除链表的结点 n0 之后的首个结点 """
def remove(n0):

2
codes/swift/chapter_array_and_linkedlist/linked_list.swift
View File

@ -9,8 +9,8 @@ import utils
/* 在链表的结点 n0 之后插入结点 P */
func insert(n0: ListNode, P: ListNode) {
let n1 = n0.next
n0.next = P
P.next = n1
n0.next = P
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/typescript/chapter_array_and_linkedlist/linked_list.ts
View File

@ -10,8 +10,8 @@ import { printLinkedList } from '../module/PrintUtil';
/* 在链表的结点 n0 之后插入结点 P */
function insert(n0: ListNode, P: ListNode): void {
const n1 = n0.next;
n0.next = P;
P.next = n1;
n0.next = P;
}
/* 删除链表的结点 n0 之后的首个结点 */

2
codes/zig/chapter_array_and_linkedlist/linked_list.zig
View File

@ -8,8 +8,8 @@ const inc = @import("include");
// 在链表的结点 n0 之后插入结点 P
pub fn insert(n0: ?*inc.ListNode(i32), P: ?*inc.ListNode(i32)) void {
var n1 = n0.?.next;
n0.?.next = P;
P.?.next = n1;
n0.?.next = P;
}
// 删除链表的结点 n0 之后的首个结点