Documentation
¶
Index ¶
- func ArithmeticSlices(nums []int) int
- func ArithmeticSlices2(nums []int) int
- func ArithmeticSlices3(nums []int) int
- func BeautifulArrangement(n int) int
- func BeautifulArrangement2(n int) int
- func BoatsToSavePeople(people []int, limit int) int
- func CheapestFlightsWithinStops(n int, flights [][]int, src int, dst int, k int) int
- func CircularArrayLoop(nums []int) bool
- func CountUnhappyFriends(n int, preferences [][]int, pairs [][]int) int
- func FindEventualSafeStates(graph [][]int) []int
- func FrogJumpingOffTheStairs(n int) int
- func MaximumNumberOfEatenApples(apples []int, days []int) int
- func NetworkDelayTime(times [][]int, n int, k int) int
- func OutOfBoundaryPaths(m int, n int, maxMove int, startRow int, startColumn int) int
- func OutOfBoundaryPaths2(m int, n int, maxMove int, startRow int, startColumn int) int
- func ShortestPathVisitingAllNodes(graph [][]int) int
- func ShortestUnsortedContinuousSubarray(nums []int) int
- func SumOfAllOddLengthSubarrays(arr []int) int
- func SuperUglyNumber(n int, primes []int) int
- func TheKWeakestRowsInAMatrix(mat [][]int, k int) []int
- func TribonacciNumber(n int) int
- func UglyNumberII(n int) int
- type ListNode
- type MedianFinder
- type MyQueue
- type Solution
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func ArithmeticSlices ¶
Arithmetic Slices leetcode: https://leetcode-cn.com/problems/arithmetic-slices/
func ArithmeticSlices2 ¶
func ArithmeticSlices3 ¶
func BeautifulArrangement ¶
Beautiful Arrangement leetcode: https://leetcode-cn.com/problems/beautiful-arrangement/
func BeautifulArrangement2 ¶
func BoatsToSavePeople ¶
Boats to Save People leetcode: https://leetcode-cn.com/problems/boats-to-save-people/
func CheapestFlightsWithinStops ¶
Cheapest Flights Within K Stops leetcode: https://leetcode-cn.com/problems/cheapest-flights-within-k-stops/
func CircularArrayLoop ¶
Circular Array Loop leetcode: https://leetcode-cn.com/problems/circular-array-loop/
func CountUnhappyFriends ¶
Count Unhappy Friends leetcode: https://leetcode-cn.com/problems/count-unhappy-friends/
func FindEventualSafeStates ¶
Find Eventual Safe States leetcode: https://leetcode-cn.com/problems/find-eventual-safe-states/ 0 => 未被访问的 1 => 已经被访问或存在环中 2 => 可到达终点
func FrogJumpingOffTheStairs ¶
青蛙跳台阶 leetcode: https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/
func MaximumNumberOfEatenApples ¶
Maximum Number of Eaten Apples leetcode: https://leetcode-cn.com/problems/maximum-number-of-eaten-apples/
func OutOfBoundaryPaths ¶
Out of Boundary Paths leetcode: https://leetcode-cn.com/problems/out-of-boundary-paths/
func OutOfBoundaryPaths2 ¶
func ShortestPathVisitingAllNodes ¶
Shortest Path Visiting All Nodes leetcode: https://leetcode-cn.com/problems/shortest-path-visiting-all-nodes/
func ShortestUnsortedContinuousSubarray ¶
Shortest Unsorted Continuous Subarray leetcode:https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/
func SumOfAllOddLengthSubarrays ¶
Sum of All Odd Length Subarrays leetcode: https://leetcode-cn.com/problems/sum-of-all-odd-length-subarrays/
func SuperUglyNumber ¶
Super Ugly Number leetcode: https://leetcode-cn.com/problems/super-ugly-number/
func TheKWeakestRowsInAMatrix ¶
The K Weakest Rows in a Matrix leetcode: https://leetcode-cn.com/problems/the-k-weakest-rows-in-a-matrix/
func TribonacciNumber ¶
N-th Tribonacci Number leetcode: https://leetcode-cn.com/problems/n-th-tribonacci-number/
func UglyNumberII ¶
Ugly Number II leetcode: https://leetcode-cn.com/problems/ugly-number-ii/
Types ¶
type ListNode ¶
Remove Zero Sum Consecutive Nodes from Linked List leetcode: https://leetcode-cn.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/
func AddTwoNumbers ¶
func AddTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode
func RemoveZeroSumSublists ¶
type MedianFinder ¶
type MedianFinder struct {
// contains filtered or unexported fields
}
Find Median from Data Stream leetcode: https://leetcode-cn.com/problems/find-median-from-data-stream/
func (*MedianFinder) AddNum ¶
func (this *MedianFinder) AddNum(num int)
func (*MedianFinder) FindMedian ¶
func (this *MedianFinder) FindMedian() float64
type MyQueue ¶
type MyQueue struct {
// contains filtered or unexported fields
}
Implement Queue using Stacks leetcode: https://leetcode-cn.com/problems/implement-queue-using-stacks/
Source Files
¶
- addTwoNumbers.go
- arithmeticSlices.go
- beautifulArrangement.go
- boatsToSavePeople.go
- cheapestFlightsWithinKStops.go
- circularArrayLoop.go
- countUnhappyFriends.go
- findEventualSafeStates.go
- findMedianFromDataStream.go
- frogJumpingOffTheStairs.go
- implementQueueUsingStacks.go
- maximumNumberOfEatenApples.go
- networkDelayTime.go
- outOfBoundaryPaths.go
- randomPickWithWeight.go
- removeZeroSumConsecutiveNodesFromLinkedList.go
- shortestPathVisitingAllNodes.go
- shortestUnsortedContinuousSubarray.go
- sumOfAllOddLengthSubarrays.go
- superUglyNumber.go
- theKWeakestRowsInAMatrix.go
- tribonacciNumber.go
- uglyNumberII.go