_021_07

Documentation

Index

• func AllNodesDistanceKInBinaryTree(root *TreeNode, target *TreeNode, k int) []int
• func DiameterOfBinaryTree(root *TreeNode) int
• func DisplayTable(orders [][]string) [][]string
• func FactorialZeros(n int) int
• func FindTheNumberInTheSortedArray(nums []int, target int) int
• func GreatestCommonDivisorOfStrings(str1 string, str2 string) string
• func KLengthApart(nums []int, k int) bool
• func LargestSumAfterKNegations(nums []int, k int) int
• func MaximumElementAfterDecrementingAndRearranging(arr []int) int
• func MaximumNumberOfBalloons(text string) int
• func MaximumSumOfConsecutiveSubarrays(nums []int) int
• func MaximumSumOfConsecutiveSubarrays2(nums []int) int
• func MinCostToConnectAllPoints(points [][]int) int
• func MinimumAbsoluteSumDifference(nums1 []int, nums2 []int) int
• func MinimumOperationsToMakeASubsequence(target []int, arr []int) int
• func PathsWithSum(root *TreeNode, sum int) int
• func RestoreTheArrayFromAdjacentPairs(adjacentPairs [][]int) []int
• func ReverseVowelsOfAString(s string) string
• func TheSkylineProblem(buildings [][]int) [][]int
• type ListNode
• type Node
  • func CopyListWithRandomPointer(head *Node) *Node
• type Pair
• type TimeMap
  • func Constructor() TimeMap
  • func (this *TimeMap) Get(key string, timestamp int) string
  • func (this *TimeMap) Set(key string, value string, timestamp int)
• type TreeNode

Functions

func AllNodesDistanceKInBinaryTree

func AllNodesDistanceKInBinaryTree(root *TreeNode, target *TreeNode, k int) []int

func DiameterOfBinaryTree

func DiameterOfBinaryTree(root *TreeNode) int

func DisplayTable

func DisplayTable(orders [][]string) [][]string

func FactorialZeros

func FactorialZeros(n int) int

Factorial Zeros leetcode: https://leetcode-cn.com/problems/factorial-zeros-lcci/

func FindTheNumberInTheSortedArray

func FindTheNumberInTheSortedArray(nums []int, target int) int

Find the Number in the Sorted Array leetcode:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/

func GreatestCommonDivisorOfStrings

func GreatestCommonDivisorOfStrings(str1 string, str2 string) string

Greatest Common Divisor of Strings leetcode: https://leetcode-cn.com/problems/greatest-common-divisor-of-strings/

func KLengthApart

func KLengthApart(nums []int, k int) bool

Check If All 1's Are at Least Length K Places Away leetcode: https://leetcode-cn.com/problems/check-if-all-1s-are-at-least-length-k-places-away/

func LargestSumAfterKNegations

func LargestSumAfterKNegations(nums []int, k int) int

Maximize Sum Of Array After K Negations leetcode: https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations/

func MaximumElementAfterDecrementingAndRearranging

func MaximumElementAfterDecrementingAndRearranging(arr []int) int

Maximum Element After Decreasing and Rearranging leetcode:https://leetcode-cn.com/problems/maximum-element-after-decreasing-and-rearranging/

func MaximumNumberOfBalloons

func MaximumNumberOfBalloons(text string) int

Maximum Number of Balloons leetcode:https://leetcode-cn.com/problems/maximum-number-of-balloons/

func MaximumSumOfConsecutiveSubarrays

func MaximumSumOfConsecutiveSubarrays(nums []int) int

连续子数组的最大和 leetcode: https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/

func MaximumSumOfConsecutiveSubarrays2

func MaximumSumOfConsecutiveSubarrays2(nums []int) int

func MinCostToConnectAllPoints

func MinCostToConnectAllPoints(points [][]int) int

func MinimumAbsoluteSumDifference

func MinimumAbsoluteSumDifference(nums1 []int, nums2 []int) int

func MinimumOperationsToMakeASubsequence

func MinimumOperationsToMakeASubsequence(target []int, arr []int) int

Minimum Operations to Make a Subsequence leetcode: https://leetcode-cn.com/problems/minimum-operations-to-make-a-subsequence/

func PathsWithSum

func PathsWithSum(root *TreeNode, sum int) int

func RestoreTheArrayFromAdjacentPairs

func RestoreTheArrayFromAdjacentPairs(adjacentPairs [][]int) []int

Restore the Array From Adjacent Pairs leetcode: https://leetcode-cn.com/problems/restore-the-array-from-adjacent-pairs/

func ReverseVowelsOfAString

func ReverseVowelsOfAString(s string) string

Reverse Vowels of a String leetcode: https://leetcode-cn.com/problems/reverse-vowels-of-a-string/

func TheSkylineProblem

func TheSkylineProblem(buildings [][]int) [][]int

Types

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

Reorder List leetcode: https://leetcode-cn.com/problems/reorder-list/

type Node

type Node struct {
	Val    int
	Next   *Node
	Random *Node
}

Copy List with Random Pointer leetcode: https://leetcode-cn.com/problems/copy-list-with-random-pointer/

func CopyListWithRandomPointer

func CopyListWithRandomPointer(head *Node) *Node

type Pair

type Pair struct {
	// contains filtered or unexported fields
}

Time Based Key-Value Store leetcode: https://leetcode-cn.com/problems/time-based-key-value-store/

type TimeMap

type TimeMap struct {
	// contains filtered or unexported fields
}

func Constructor

func Constructor() TimeMap

func (*TimeMap) Get

func (this *TimeMap) Get(key string, timestamp int) string

func (*TimeMap) Set

func (this *TimeMap) Set(key string, value string, timestamp int)

type TreeNode

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

Second Minimum Node In a Binary Tree leetcode:https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree/