update

Author: ldeng7

000xxx/002.go

@@ -1,7 +1,6 @@
 func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
 	h := &ListNode{}
-	l := h
-	c := 0
+	n, c := h, 0
 	for nil != l1 || nil != l2 {
 		d1, d2 := 0, 0
 		if nil != l1 {
@@ -17,8 +16,8 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
 		} else {
 			c = 0
 		}
-		l.Next = &ListNode{Val: d}
-		l = l.Next
+		n.Next = &ListNode{Val: d}
+		n = n.Next
 		if nil != l1 {
 			l1 = l1.Next
 		}
@@ -27,7 +26,7 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
 		}
 	}
 	if 1 == c {
-		l.Next = &ListNode{Val: 1}
+		n.Next = &ListNode{Val: 1}
 	}
 	return h.Next
 }

000xxx/003.go

@@ -1,16 +1,15 @@
 func lengthOfLongestSubstring(s string) int {
-	m := map[rune]int{}
-	j, out := 0, 0
-	for i, r := range s {
-		if k, ok := m[r]; ok && k >= j {
+	m := map[byte]int{}
+	j, o := 0, 0
+	for i := 0; i < len(s); i++ {
+		c := s[i]
+		if k, ok := m[c]; ok && k >= j {
 			j = k + 1
 		}
-		m[r] = i
-
-		l := i - j + 1
-		if l > out {
-			out = l
+		m[c] = i
+		if o1 := i - j + 1; o1 > o {
+			o = o1
 		}
 	}
-	return out
+	return o
 }

000xxx/004.go

@@ -1,4 +1,4 @@
-func find(nums1 []int, nums2 []int, k int) int {
+func cal(nums1 []int, nums2 []int, k int) int {
 	l1, l2 := len(nums1), len(nums2)
 	if 0 == l1 {
 		return nums2[k-1]
@@ -20,14 +20,14 @@ func find(nums1 []int, nums2 []int, k int) int {
 		j = l2
 	}
 	if nums1[i-1] > nums2[j-1] {
-		return find(nums1, nums2[j:], k-j)
+		return cal(nums1, nums2[j:], k-j)
 	} else {
-		return find(nums1[i:], nums2, k-i)
+		return cal(nums1[i:], nums2, k-i)
 	}
 	return 0
 }
 
 func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
 	l1, l2 := len(nums1), len(nums2)
-	return float64(find(nums1, nums2, (l1+l2+1)/2)+find(nums1, nums2, (l1+l2+2)/2)) / 2.0
+	return float64(cal(nums1, nums2, (l1+l2+1)/2)+cal(nums1, nums2, (l1+l2+2)/2)) / 2.0
 }

000xxx/005.go

@@ -1,18 +1,20 @@
 func longestPalindrome(s string) string {
-	if 0 == len(s) {
+	l := len(s)
+	if 0 == l {
 		return ""
 	}
-	t := []byte{'#'}
-	for _, c := range []byte(s) {
-		t = append(t, c)
-		t = append(t, '#')
+	t, i := make([]byte, l<<1+1), 1
+	t[0] = '#'
+	for j := 0; j < l; j++ {
+		t[i], t[i+1], i = s[j], '#', i+2
 	}
+	l = len(t)
 
 	m, mi := 0, 0
-	for i := 0; i < len(t); i++ {
+	for i := 0; i < l; i++ {
 		k := i
-		if len(t)-i-1 < k {
-			k = len(t) - i - 1
+		if k1 := l - i - 1; k1 < k {
+			k = k1
 		}
 		j := 1
 		for ; j <= k; j++ {
@@ -24,7 +26,6 @@ func longestPalindrome(s string) string {
 			m, mi = j, i
 		}
 	}
-	var i int
 	if mi&1 == 1 {
 		i = mi/2 + 1 - m/2
 	} else {

000xxx/006.go

@@ -2,16 +2,15 @@ func convert(s string, numRows int) string {
 	if numRows <= 1 {
 		return s
 	}
-	out := []byte{}
-	n := (numRows - 1) * 2
+	o, n := []byte{}, (numRows-1)<<1
 	for i := 0; i < numRows; i++ {
 		for j := i; j < len(s); j += n {
-			out = append(out, s[j])
+			o = append(o, s[j])
 			k := j + n - i*2
 			if i > 0 && i < numRows-1 && k < len(s) {
-				out = append(out, s[k])
+				o = append(o, s[k])
 			}
 		}
 	}
-	return string(out)
+	return string(o)
 }

000xxx/007.go

@@ -1,16 +1,13 @@
 func reverse(x int) int {
 	m := false
 	if x < 0 {
-		m = true
-		x = -x
+		m, x = true, -x
 	}
-	ds := []int{}
+	ds := make([]int, 0, 8)
 	for x > 0 {
-		ds = append(ds, x%10)
-		x /= 10
+		ds, x = append(ds, x%10), x/10
 	}
-	o := 0
-	b := 1
+	o, b := 0, 1
 	for i := len(ds) - 1; i >= 0; i-- {
 		o += ds[i] * b
 		b *= 10

000xxx/008.go

@@ -1,25 +1,22 @@
 func myAtoi(str string) int {
-	ds := []byte{}
-	m := false
-	started := false
-	for _, c := range []byte(str) {
+	ds, m, started := []byte{}, false, false
+	for i := 0; i < len(str); i++ {
+		c := str[i]
 		if c == ' ' {
 			if started {
 				break
 			}
 			continue
 		} else if c == '+' || c == '-' {
 			if !started {
-				started = true
-				m = c == '-'
+				started, m = true, c == '-'
 				continue
 			}
 			break
 		} else if c < '0' || c > '9' {
 			break
 		}
-		started = true
-		ds = append(ds, c)
+		started, ds = true, append(ds, c)
 	}
 
 	dst := []byte{}
@@ -28,8 +25,7 @@ func myAtoi(str string) int {
 		if c == '0' && !started {
 			continue
 		}
-		started = true
-		dst = append(dst, c)
+		started, dst = true, append(dst, c)
 	}
 	ds = dst
 	if len(ds) > 11 {

000xxx/009.go

@@ -2,13 +2,14 @@ func isPalindrome(x int) bool {
 	if x < 0 {
 		return false
 	}
-	ds := []int{}
+	ds := make([]int, 0, 8)
 	for x > 0 {
 		ds = append(ds, x%10)
 		x /= 10
 	}
-	for i := 0; i < (len(ds) >> 1); i++ {
-		if ds[i] != ds[len(ds)-1-i] {
+	l := len(ds)
+	for i := 0; i < l>>1; i++ {
+		if ds[i] != ds[l-1-i] {
 			return false
 		}
 	}

000xxx/046.go

@@ -4,15 +4,16 @@ func permute(nums []int) [][]int {
 	}
 	out := [][]int{}
 	for i, num := range nums {
-		rest := []int{}
+		rest, k := make([]int, len(nums)-1), 0
 		for j, num1 := range nums {
 			if i != j {
-				rest = append(rest, num1)
+				rest[k], k = num1, k+1
 			}
 		}
 		for _, ar := range permute(rest) {
-			ar1 := []int{num}
-			ar1 = append(ar1, ar...)
+			ar1 := make([]int, len(ar)+1)
+			ar1[0] = num
+			copy(ar1[1:], ar)
 			out = append(out, ar1)
 		}
 	}

000xxx/068.go

@@ -0,0 +1,42 @@
+import "bytes"
+
+func fullJustify(words []string, maxWidth int) []string {
+	o, l, i := []string{}, len(words), 0
+	for i < l {
+		j, n := i, 0
+		for ; j < l && n+len(words[j])+j-i <= maxWidth; j++ {
+			n += len(words[j])
+		}
+		buf := &bytes.Buffer{}
+		ns := maxWidth - n
+		for k := i; k < j; k++ {
+			buf.WriteString(words[k])
+			if ns > 0 {
+				m := 0
+				if j == l {
+					if j-k == 1 {
+						m = ns
+					} else {
+						m = 1
+					}
+				} else {
+					t := j - k - 1
+					if t > 0 {
+						m = ns / t
+						if ns%t != 0 {
+							m++
+						}
+					} else {
+						m = ns
+					}
+				}
+				ns -= m
+				for ; m > 0; m-- {
+					buf.WriteByte(' ')
+				}
+			}
+		}
+		o, i = append(o, buf.String()), j
+	}
+	return o
+}