update

Author: ldeng7

001xxx/143.go

@@ -0,0 +1,24 @@
+func max(a, b int) int {
+	if a <= b {
+		return b
+	}
+	return a
+}
+
+func longestCommonSubsequence(text1 string, text2 string) int {
+	m, n := len(text1), len(text2)
+	t := make([][]int, m+1)
+	for i := 0; i <= m; i++ {
+		t[i] = make([]int, n+1)
+	}
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			if text1[i] == text2[j] {
+				t[i+1][j+1] = t[i][j] + 1
+			} else {
+				t[i+1][j+1] = max(t[i+1][j], t[i][j+1])
+			}
+		}
+	}
+	return t[m][n]
+}

001xxx/177.go

@@ -0,0 +1,23 @@
+func cnt(i uint32) uint32 {
+	i = (i & 0x55555555) + ((i >> 1) & 0x55555555)
+	i = (i & 0x33333333) + ((i >> 2) & 0x33333333)
+	i = (i & 0x0f0f0f0f) + ((i >> 4) & 0x0f0f0f0f)
+	i = (i & 0x00ff00ff) + ((i >> 8) & 0x00ff00ff)
+	i = (i & 0x0000ffff) + ((i >> 16) & 0x0000ffff)
+	return i
+}
+
+var ms = [100001]uint32{}
+
+func canMakePaliQueries(s string, queries [][]int) []bool {
+	o, l := make([]bool, len(queries)), len(s)
+	var m uint32
+	for i := 0; i < l; i++ {
+		m ^= 1 << (s[i] - 'a')
+		ms[i+1] = m
+	}
+	for i, q := range queries {
+		o[i] = cnt(ms[q[0]]^ms[q[1]+1])>>1 <= uint32(q[2])
+	}
+	return o
+}

001xxx/184.go

@@ -0,0 +1,16 @@
+func distanceBetweenBusStops(distance []int, start int, destination int) int {
+	if start > destination {
+		start, destination = destination, start
+	}
+	s, s1 := 0, 0
+	for i, d := range distance {
+		s += d
+		if i >= start && i < destination {
+			s1 += d
+		}
+	}
+	if s0 := s - s1; s0 < s1 {
+		s1 = s0
+	}
+	return s1
+}

001xxx/185.go

@@ -0,0 +1,5 @@
+import "time"
+
+func dayOfTheWeek(day int, month int, year int) string {
+	return time.Date(year, time.Month(month), day, 0, 0, 0, 0, time.Local).Weekday().String()
+}

001xxx/189.go

@@ -0,0 +1,32 @@
+func maxNumberOfBalloons(text string) int {
+	c1, c2, c3, c4, c5 := 0, 0, 0, 0, 0
+	for i := 0; i < len(text); i++ {
+		switch text[i] {
+		case 'b':
+			c1++
+		case 'a':
+			c2++
+		case 'l':
+			c3++
+		case 'o':
+			c4++
+		case 'n':
+			c5++
+		}
+	}
+	c3, c4 = c3>>1, c4>>1
+	o := c1
+	if c2 < c1 {
+		o = c2
+	}
+	if c3 < c2 {
+		o = c3
+	}
+	if c4 < c3 {
+		o = c4
+	}
+	if c5 < c4 {
+		o = c5
+	}
+	return o
+}

001xxx/207.go

@@ -0,0 +1,14 @@
+func uniqueOccurrences(arr []int) bool {
+	m := map[int]int{}
+	for _, a := range arr {
+		m[a]++
+	}
+	m1 := map[int]bool{}
+	for _, c := range m {
+		if m1[c] {
+			return false
+		}
+		m1[c] = true
+	}
+	return true
+}