fxss-leetcode

Appearance

83. 删除排序链表中的重复元素 ​

83. 删除排序链表中的重复元素

给定一个已排序的链表的头 head ， 删除所有重复的元素，使每个元素只出现一次 。返回 已排序的链表 。

示例 ​

示例1 ​

输入：head = [1,1,2]

输出：[1,2]

示例2 ​

输入：head = [1,1,2,3,3]

输出：[1,2,3]

提示 ​

  1. 链表中节点数目在范围 [0, 300] 内
  2. -100 <= Node.val <= 100
  3. 题目数据保证链表已经按升序 排列

代码 ​

javascript
export function ListNodeJs(val, next) {
  this.val = (val === undefined ? 0 : val)
  this.next = (next === undefined ? null : next)
}
typescript
export class ListNode {
  val: number
  next: ListNode | null
  constructor(val?: number, next?: ListNode | null) {
    this.val = (val === undefined ? 0 : val)
    this.next = (next === undefined ? null : next)
  }
}
javascript
// 83. 删除排序链表中的重复元素
// https://leetcode.cn/problems/remove-duplicates-from-sorted-list/description/

export function deleteDuplicates(head) {
  if (!head) {
    return head;
  }

  let cur = head;
  while (cur.next) {
    if (cur.val === cur.next.val) {
      cur.next = cur.next.next;
    } else {
      cur = cur.next;
    }
  }
  return head;
};
typescript
// 83. 删除排序链表中的重复元素
// https://leetcode.cn/problems/remove-duplicates-from-sorted-list/description/

import { ListNode } from "../../utils"

export function deleteDuplicates(head: ListNode | null): ListNode | null {
  if (!head) {
    return head;
  }

  let cur = head;
  while (cur.next) {
    if (cur.val === cur.next.val) {
      cur.next = cur.next.next;
    } else {
      cur = cur.next;
    }
  }
  return head;
};

测试代码 ​

ts
import { expect, test } from 'vitest'
import { getListNode } from "../../../src/utils"
import { deleteDuplicates } from './typescript.ts'
import { getListNodeJs } from "../../../src/utilsJs"
import { deleteDuplicates as deleteDuplicatesJs } from './javascript.js'

const a1 = [1, 1, 2]
const a2 = [1, 2]
const aL1 = getListNode(a1)
const aL2 = getListNode(a2)

test(`deleteDuplicates(aL1) toEqual aL2`, () => {
  expect(deleteDuplicates(aL1)).toEqual(aL2)
})

const a3 = [1, 1, 2, 3, 3]
const a4 = [1, 2, 3]
const aL3 = getListNode(a3)
const aL4 = getListNode(a4)

test(`deleteDuplicates(aL3) toEqual aL4`, () => {
  expect(deleteDuplicates(aL3)).toEqual(aL4)
})

const a5 = [1, 1, 2]
const a6 = [1, 2]
const aL5 = getListNodeJs(a5)
const aL6 = getListNodeJs(a6)

test(`deleteDuplicatesJs(aL5) toEqual aL6`, () => {
  expect(deleteDuplicatesJs(aL5)).toEqual(aL6)
})

const a7 = [1, 1, 2, 3, 3]
const a8 = [1, 2, 3]
const aL7 = getListNodeJs(a7)
const aL8 = getListNodeJs(a8)

test(`deleteDuplicatesJs(aL7) toEqual aL8`, () => {
  expect(deleteDuplicatesJs(aL7)).toEqual(aL8)
})