medium

Documentation

Index

• Constants
• func BuildTree(preorder []int, inorder []int) *hard.TreeNode
• func BulbSwitch(n int) int
• func IsValidSudoku(board [][]byte) bool
• func KnightProbability(n, k, row, column int) float64
• func PartitionLabels(s string) []int
• func RestoreIpAddresses(s string) []string
• func Reverse(x int) int
• func SetZeroes(matrix [][]int)
• func SimplifiedFractions(n int) []string
• func SingleNonDuplicate(nums []int) int
• func SubArrayRanges(nums []int) int64
• type Codec
  • func Constructor() Codec
• type ListNode
  • func AddTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode
• type Node
  • func Connect(root *Node) *Node
• type TreeNode

Constants

const INT_MAX = int(^uint(0) >> 1)

const INT_MIN = ^INT_MAX

Functions

func BuildTree

func BuildTree(preorder []int, inorder []int) *hard.TreeNode

func BulbSwitch

func BulbSwitch(n int) int

func IsValidSudoku

func IsValidSudoku(board [][]byte) bool

@lc code=start

func KnightProbability

func KnightProbability(n, k, row, column int) float64

func PartitionLabels

func PartitionLabels(s string) []int

func RestoreIpAddresses

func RestoreIpAddresses(s string) []string

func Reverse

func Reverse(x int) int

func SetZeroes

func SetZeroes(matrix [][]int)

@lc code=start

func SimplifiedFractions

func SimplifiedFractions(n int) []string

func SingleNonDuplicate

func SingleNonDuplicate(nums []int) int

func SubArrayRanges

func SubArrayRanges(nums []int) int64

Types

type Codec

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

func Constructor

func Constructor() Codec

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

func AddTwoNumbers

func AddTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode

type Node

type Node struct {
	Val   int
	Left  *Node
	Right *Node
	Next  *Node
}

*

• Definition for a Node.
• type Node struct {
• Val int
• Left *Node
• Right *Node
• Next *Node
• }

func Connect

func Connect(root *Node) *Node

type TreeNode

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