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
- type Pair
- type TimeMap
- type TreeNode
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func DiameterOfBinaryTree ¶
func DiameterOfBinaryTree(root *TreeNode) int
func DisplayTable ¶
func FactorialZeros ¶
Factorial Zeros leetcode: https://leetcode-cn.com/problems/factorial-zeros-lcci/
func FindTheNumberInTheSortedArray ¶
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 ¶
Greatest Common Divisor of Strings leetcode: https://leetcode-cn.com/problems/greatest-common-divisor-of-strings/
func KLengthApart ¶
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 ¶
Maximize Sum Of Array After K Negations leetcode: https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations/
func MaximumElementAfterDecrementingAndRearranging ¶
Maximum Element After Decreasing and Rearranging leetcode:https://leetcode-cn.com/problems/maximum-element-after-decreasing-and-rearranging/
func MaximumNumberOfBalloons ¶
Maximum Number of Balloons leetcode:https://leetcode-cn.com/problems/maximum-number-of-balloons/
func MaximumSumOfConsecutiveSubarrays ¶
连续子数组的最大和 leetcode: https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/
func MinimumOperationsToMakeASubsequence ¶
Minimum Operations to Make a Subsequence leetcode: https://leetcode-cn.com/problems/minimum-operations-to-make-a-subsequence/
func PathsWithSum ¶
func RestoreTheArrayFromAdjacentPairs ¶
Restore the Array From Adjacent Pairs leetcode: https://leetcode-cn.com/problems/restore-the-array-from-adjacent-pairs/
func ReverseVowelsOfAString ¶
Reverse Vowels of a String leetcode: https://leetcode-cn.com/problems/reverse-vowels-of-a-string/
func TheSkylineProblem ¶
Types ¶
type ListNode ¶
Reorder List leetcode: https://leetcode-cn.com/problems/reorder-list/
type Node ¶
Copy List with Random Pointer leetcode: https://leetcode-cn.com/problems/copy-list-with-random-pointer/
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
Source Files
¶
- allNodesDistanceKInBinaryTree.go
- balancedBinaryTree.go
- checkOne.go
- commonNodeInTwoLinkedList.go
- copyListWithRandomPointer.go
- diameterOfBinaryTree.go
- displayTable.go
- factorialZeros.go
- findTheNumberInSortedArray.go
- greatestCommonDivisorOfStrings.go
- largestSumAfterKNegations.go
- maximumElementAfterDecrementingAndRearranging.go
- maximumNumberOfBalloons.go
- maximumSumOfConsecutiveSubarrays.go
- minCostToConnectAllPoints.go
- minimumAbsoluteSumDifference.go
- minimumDepthOfBinaryTree.go
- minimumOperationsToMakeASubsequence.go
- pathsWithSum.go
- reciprocalKthNodeInLinkedList.go
- reorderList.go
- restoreTheArrayFromAdjacentPairs.go
- reverseVowelsOfAString.go
- secondMinimumNodeInABinaryTree.go
- theSkylineProblem.go
- timeBasedKeyValueStore.go
- verticalOrderTraversalOfABinaryTree.go