Documentation
¶
Index ¶
- func AllPathFromSourceToTarget(graph [][]int) [][]int
- func BrickWall(wall [][]int) int
- func BuildAnArrayOfProduct(a []int) []int
- func BulbSwitcherIV(target string) int
- func CircusTowerLCCI(height []int, weight []int) int
- func CountTripletsThatCanFormTwoArraysOfEqualXOR(arr []int) int
- func CourseSchedule(numCourses int, prerequisites [][]int) bool
- func CourseSchedule2(numCourses int, prerequisites [][]int) bool
- func CousinsInBinaryTree(root *TreeNode, x, y int) bool
- func DecodeXORedArray(encoded []int, first int) []int
- func DecodeXORedPermutation(encoded []int) []int
- func DeleteAndEarn(nums []int) int
- func EmployeeImportance2(employees []*Employee, id int) int
- func FindKthLargestXORCoordinateValue(matrix [][]int, k int) int
- func FindLargestValueInEachTreeRow(root *TreeNode) []int
- func FindPeakElement(nums []int) int
- func FindPeakElement2(nums []int) int
- func FindPeakElement3(nums []int) int
- func HammingDistance(x, y int) int
- func IncreasingTripletSubsequence(nums []int) bool
- func IntegerReplacement2(n int) int
- func IntegerReplacement3(n int) int
- func IntegerToRoman(num int) string
- func KeysAndRooms(rooms [][]int) bool
- func LeafSimilarTrees(root1, root2 *TreeNode) bool
- func LinkedListComponents(head *ListNode, nums []int) int
- func LongestConsecutiveSequence(nums []int) int
- func LongestConsecutiveSequence2(nums []int) int
- func LongestSubstringWithoutRepeatingCharacters(s string) int
- func LongestZigzagPathInABinaryTree(root *TreeNode) int
- func MaxNumberOfKSumPairs(nums []int, k int) int
- func MaxNumberOfKSumPairs2(nums []int, k int) int
- func MaxSumOfRectangleNoLargerThanK(matrix [][]int, k int) int
- func MaximumLevelSumOfABinaryTree(root *TreeNode) int
- func MaximumProfitOfTheStock(prices []int) int
- func MinimumElementsToAddToFormAGivenSum(nums []int, limit, goal int) int
- func MinimumNumberOfDaysToMakeMBouquets(bloomDay []int, m, k int) int
- func MostProfitAssigningWork(difficulty, profit, worker []int) int
- func NumberOfDiceRollsWithTargetSum(d, f, target int) int
- func NumberOfSubmatricesThatSumToTarget(matrix [][]int, target int) int
- func NumberOfWaysToStayInTheSamePlaceAfterSomeSteps(steps, arrLen int) int
- func OnesAndZeros(strs []string, m, n int) int
- func PerfectSquares(n int) int
- func PowerOfFour(n int) bool
- func PowerOfTwo(n int) bool
- func PowerOfTwo2(n int) bool
- func PredictTheWinner(nums []int) bool
- func PrintBinaryTreeFromTopToBottom(root *TreeNode) []int
- func QueensThatCanAttackKing(queens [][]int, king []int) [][]int
- func ReverseInteger(x int) int
- func ReverseSubstringsBetweenEachPairOfParentheses(s string) string
- func RomanToInteger(s string) int
- func SatisfiabilityOfEqualityEquations(equations []string) bool
- func SingleElementInASortedArray(nums []int) int
- func SingleElementInASortedArray2(nums []int) int
- func SingleElementInASortedArray3(nums []int) int
- func SmallestDifference(a, b []int) int
- func StrangePrinter(s string) int
- func SubarraySumEqualsK(nums []int, k int) int
- func SubarraySumEqualsK2(nums []int, k int) int
- func TeemoAttacking(timeSeries []int, duration int) int
- func ThreeSum(nums []int) [][]int
- func ThreeSumClosest(nums []int, target int) int
- func TopKFrequent(words []string, k int) []string
- func TotalHammingDistance(nums []int) int
- func TwoSum(nums []int, target int) []int
- func TwoSum2(nums []int, target int) []int
- func UncrossedLines(nums1 []int, nums2 []int) int
- func UniqueBinarySearchTrees(n int) int
- func XOROperationInAnArray(n, start int) int
- func XORQueriesOfASubarray(arr []int, queries [][]int) []int
- type Employee
- type ListNode
- type TreeNode
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func BuildAnArrayOfProduct ¶
func BulbSwitcherIV ¶
func CousinsInBinaryTree ¶
func DecodeXORedArray ¶
func DecodeXORedPermutation ¶
func EmployeeImportance2 ¶
func FindLargestValueInEachTreeRow ¶
func FindLargestValueInEachTreeRow(root *TreeNode) []int
func FindPeakElement ¶
func HammingDistance ¶
func IntegerToRoman ¶
func KeysAndRooms ¶
func LeafSimilarTrees ¶
func LeafSimilarTrees(root1, root2 *TreeNode) bool
func LinkedListComponents ¶
func LongestZigzagPathInABinaryTree ¶
func LongestZigzagPathInABinaryTree(root *TreeNode) int
func MaxNumberOfKSumPairs ¶
func MaximumLevelSumOfABinaryTree ¶
func MaximumLevelSumOfABinaryTree(root *TreeNode) int
func MaximumProfitOfTheStock ¶
func MostProfitAssigningWork ¶
func OnesAndZeros ¶
func PerfectSquares ¶
func PowerOfFour ¶
func PowerOfTwo ¶
func PowerOfTwo2 ¶
func PredictTheWinner ¶
func PrintBinaryTreeFromTopToBottom ¶
func PrintBinaryTreeFromTopToBottom(root *TreeNode) []int
func QueensThatCanAttackKing ¶
func ReverseInteger ¶
func RomanToInteger ¶
func SmallestDifference ¶
func StrangePrinter ¶
func SubarraySumEqualsK ¶
func SubarraySumEqualsK2 ¶
func TeemoAttacking ¶
func ThreeSumClosest ¶
func TopKFrequent ¶
func TotalHammingDistance ¶
func UncrossedLines ¶
func UniqueBinarySearchTrees ¶
func XOROperationInAnArray ¶
func XORQueriesOfASubarray ¶
Types ¶
type ListNode ¶
func LinkedListCycleII ¶
type TreeNode ¶
func AddOneRowToTree ¶
func AddOneRowToTree(root *TreeNode, val, depth int) *TreeNode
func DeleteNodesAndReturnForest ¶
func DeleteNodesAndReturnForest(root *TreeNode, to_delete []int) []*TreeNode
func Successor2 ¶
func Successor3 ¶
Source Files
¶
- 3Sum.go
- 3SumClosest.go
- XOROperationInAnArray.go
- XORQueriesOfASubarray.go
- addOneRowToTree.go
- allPathsFromSourceToTarget.go
- brickWall.go
- buildAnArrayOfProduct.go
- bulbSwitcherIV.go
- circusTowerLCCI.go
- countTripletsThatCanFormTwoArraysOfEqualXOR.go
- courseSchedule.go
- cousinsInBinaryTree.go
- decodeXORedArray.go
- decodeXORedPermutation.go
- deleteAndEarn.go
- deleteNodesAndReturnForest.go
- employeeImportance.go
- findKthLargestXORCoordinateValue.go
- findLargestValueInEachTreeRow.go
- findPeakElement.go
- hammingDistance.go
- increasingTripletSubsequence.go
- integerReplacement.go
- integerToRoman.go
- keysAndRooms.go
- leafSimilarTrees.go
- linkedListComponents.go
- linkedListCycleII.go
- longestConsecutiveSequence.go
- longestSubstringWithoutRepeatingCharacters.go
- longestZigzagPathInABinaryTree.go
- maxNumberOfK-SumPairs.go
- maxSumOfRectangleNoLargerThanK.go
- maximumLevelSumOfABinaryTree.go
- maximumProfitOfTheStock.go
- minimumElementsToAddToFormAGivenSum.go
- minimumNumberOfDaysToMakeMBouquets.go
- mostProfitAssigningWork.go
- numberOfDiceRollsWithTargetSum.go
- numberOfSubmatricesThatSumToTarget.go
- numberOfWaysToStayInTheSamePlaceAfterSomeSteps.go
- onesAndZeroes.go
- perfectSquares.go
- powerOfFour.go
- powerOfTwo.go
- predictTheWinner.go
- printBinaryTreeFromTopToBottom.go
- queensThatCanAttackKing.go
- reverseInteger.go
- reverseSubstringsBetweenEachPairOfParentheses.go
- romanToInteger.go
- satisfiabilityOfEqualityEquations.go
- singleElementInASortedArray.go
- smallestDifference.go
- strangePrinter.go
- subarraySumEqualsK.go
- successor.go
- teemoAttacking.go
- topKFrequentWords.go
- totalHammingDistance.go
- twoSum.go
- uncrossedLines.go
- uniqueBinarySearchTrees.go
Click to show internal directories.
Click to hide internal directories.