_021_11

Documentation

Index

• func CourseScheduleIIBFS(numCourses int, prerequisites [][]int) []int
• func CourseScheduleIIDFS(numCourses int, prerequisites [][]int) []int
• func IsLeave(tn *TreeNode) bool
• func PathSum(root *TreeNode, targetSum int) bool
• func PathSumII(root *TreeNode, targetSum int) [][]int
• func PathSumII2(root *TreeNode, targetSum int) [][]int
• func SumOfLeftLeaves(root *TreeNode) int
• func SumOfLeftLeaves2(root *TreeNode) int
• type ListNode
  • func RemoveDuplicatesFromSortedList(head *ListNode) *ListNode
  • func RemoveDuplicatesFromSotredListII(head *ListNode) *ListNode
• type TreeNode

Functions

func CourseScheduleIIBFS

func CourseScheduleIIBFS(numCourses int, prerequisites [][]int) []int

Course Schedule II leetcode: https://leetcode-cn.com/problems/course-schedule-ii/

func CourseScheduleIIDFS

func CourseScheduleIIDFS(numCourses int, prerequisites [][]int) []int

func IsLeave

func IsLeave(tn *TreeNode) bool

func PathSum

func PathSum(root *TreeNode, targetSum int) bool

func PathSumII

func PathSumII(root *TreeNode, targetSum int) [][]int

func PathSumII2

func PathSumII2(root *TreeNode, targetSum int) [][]int

func SumOfLeftLeaves

func SumOfLeftLeaves(root *TreeNode) int

func SumOfLeftLeaves2

func SumOfLeftLeaves2(root *TreeNode) int

Types

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

Remove Duplicates from Sorted List II https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/

func RemoveDuplicatesFromSortedList

func RemoveDuplicatesFromSortedList(head *ListNode) *ListNode

func RemoveDuplicatesFromSotredListII

func RemoveDuplicatesFromSotredListII(head *ListNode) *ListNode

type TreeNode

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

Sum of Left Leaves leetcode: https://leetcode-cn.com/problems/sum-of-left-leaves/