移除链表元素

Sat, 05 Jun 2021 23:29:36 +0800

题目: 给你一个链表的头节点 head 和一个整数 val ，请你删除链表中所有满足 Node.val == val 的节点，并返回新的头节点，具体见链接 LeetCode-203

相关代码如下：

package main

import "fmt"

type ListNode struct {
	Val int
	Next *ListNode
}

//crete linklist
func CreateNode(node *ListNode, max int) {
	cur := node
	for i := 1; i < max; i++ {
		cur.Next = &ListNode{}
		cur.Next.Val = i
		cur = cur.Next
	}
}

//print linklist
func PrintNode(node *ListNode) {
	for cur := node; cur != nil; cur = cur.Next {
		fmt.Print(cur.Val, " ")
	}
	fmt.Println()
}

//leetcode 203. 移除链表元素
func removeElements(head *ListNode, val int) *ListNode {
	if head == nil {
		return head
	}
	head.Next = removeElements(head.Next, val)
	if head.Val == val {
		return head.Next
	}
	return head
}

func main() {
	var head = new(ListNode)
	CreateNode(head, 7)
	removeElements(head, 6)
	PrintNode(head)

}

Fibonacci

Sun, 04 Apr 2021 23:28:44 +0800

斐波那契数

package main

import "fmt"

//动态规划
func fib(n int) int {
	if n < 2 {
		return n
	}
	nums := make([]int, n)
	nums[0], nums[1] = 1, 1
	for i := 2; i < n; i++ {
		// nums[i] = (nums[i-1] + nums[i-2]) % 1000000007
		nums[i] = nums[i-1] + nums[i-2]
	}
	return nums[n-1]
}
//递归
func fib01(n int) int {
	if n < 2 {
		return n
	}
	return fib01(n-1) + fib01(n-2)
}

func main() {
	var n int
	fmt.Scanln(&n)
	fmt.Println(fib(n))
	fmt.Println("the fib01 is ", fib01(n))

}

LeetCode on Qstudy的博客

移除链表元素

Fibonacci