leetcode

package

v0.0.0-...-f59f4bf Latest Latest Go to latest Published: Dec 18, 2024 License: Apache-2.0 Imports: 4 Imported by: 0

Details

This section is empty.

This section is empty.

func IsPowerOf2(n int) bool

func MaxLen(s []string) int

func MaxProduct(s []string) int

func Solution(n int) []int

func Solution2(n int) []int

func Solution3(n int) []int

func Solution4(n int) []int

func Solution5(n int) []int

leetcode 338 原题，动态规划的转移方程：bits[i] = bits[i >> 1] + (i & 1)。它的题解需要用n+1个元素的数组，我这里为了跟上面保持一致，就用n了

func Solution6(n int) []int

type ListNode struct {
	Val  int
	Next *ListNode
}

Definition for singly-linked list.

func (l *ListNode) ToSlice() []int