Leetcode Practice

HEJTAO.COM — Tue, 19 Oct 2021 00:00:00 +0000

Array 704. Binary Search 👉 LeetCode func search(nums []int, target int) int { left, right := 0, len(nums)-1 for left <= right{ mid := （right - left) >> 1 + left if nums[mid] == target{ return mid }else if nums[mid] < target { left = mid + 1 }else{ right = mid - 1 } } return -1 } Find The Single Number Example 1 input: nums = [2,2,3,3,4] output: 4

大话数据结构

HEJTAO.COM — Thu, 20 Dec 2018 00:00:00 +0000

3.4 顺序存储结构数值 data(起始位置)；数组长度 MaxSize；线性表长度 length LOC($a_{i}$)=LOC($a_{1}$)+(i-1)c 3.6 链式存储结构单链表，每个节点只包含一个指针域头指针，头节点，第一个节点 package main import ( "fmt" ) type Node struct { data string next *Node } type LinkList struct { length int head *Node rear *Node } func NewLinkList(head *Node) *LinkList { return &LinkList{0, head, head} } func (this *LinkList) Append(data string) { if this.rear == nil { return } node := &Node{data: data} this.rear.next = node this.rear = node this.

Data Structure - Tag - HEJTAO

Leetcode Practice

大话数据结构