add new files

Author: anakin

303. Range Sum Query - Immutable.go

@@ -0,0 +1,36 @@
+package main
+
+type NumArray struct {
+	nums []int
+}
+
+func Constructor(nums []int) NumArray {
+	nn := []int{}
+	if len(nums) <= 1 {
+		nn = nums
+	} else {
+		nn = append(nn, nums[0])
+		for i := 1; i < len(nums); i++ {
+			nn = append(nn, nums[i]+nn[i-1])
+		}
+	}
+	return NumArray{
+		nums: nn,
+	}
+}
+
+func (this *NumArray) SumRange(i int, j int) int {
+	if i == 0 {
+		return this.nums[j]
+	} else {
+		return this.nums[j] - this.nums[i-1]
+	}
+}
+
+//
+//func main() {
+//	r := []int{-2, 0, 3, -5, 2, -1}
+//	a := Constructor(r)
+//	b := a.SumRange(0, 2)
+//	fmt.Println(b)
+//}

307. Range Sum Query - Mutable.go

@@ -0,0 +1,46 @@
+package main
+
+import "github.com/olivere/elastic"
+
+type NumArray struct {
+	n []int
+}
+
+func Constructor(nums []int) NumArray {
+	n := []int{}
+	if len(nums) <= 1 {
+		n = nums
+	} else {
+		n = append(n, nums[0])
+		for i := 1; i < len(nums); i++ {
+			n = append(n, nums[i]+n[i-1])
+		}
+	}
+	return NumArray{
+		n: n,
+	}
+}
+
+func (this *NumArray) Update(i int, val int) {
+	l := len(this.n)
+	if i < 0 || i > l-1 {
+		return
+	}
+	var diff int
+	if i == 0 {
+		diff = val - this.n[0]
+	} else {
+		diff = val - (this.n[i] - this.n[i-1])
+	}
+	for j := i; j < l; j++ {
+		this.n[j] += diff
+	}
+}
+
+func (this *NumArray) SumRange(i int, j int) int {
+	if i == 0 {
+		return this.n[j]
+	} else {
+		return this.n[j] - this.n[i-1]
+	}
+}

345. Reverse Vowels of a String.go

@@ -0,0 +1,22 @@
+package main
+
+func reverseVowels(s string) string {
+	t := []byte(s)
+	m := make(map[byte]bool)
+	m['o'], m['e'], m['a'], m['i'], m['u'] = true, true, true, true, true
+	m['O'], m['E'], m['A'], m['I'], m['U'] = true, true, true, true, true
+	for i, j := 0, len(t)-1; i < j; i, j = i+1, j-1 {
+		for i < j && !m[t[i]] {
+			i++
+		}
+		for j > i && !m[t[j]] {
+			j--
+		}
+		if i >= j {
+			break
+		}
+		t[i], t[j] = t[j], t[i]
+	}
+	return string(t)
+
+}

383. Ransom Note.go

@@ -0,0 +1,17 @@
+package main
+
+//一个入hash表，查另一个
+func canConstruct(ransomNote string, magazine string) bool {
+	m := make(map[rune]int)
+	for _, v := range magazine {
+		m[v]++
+	}
+	for _, v := range ransomNote {
+		c, ok := m[v]
+		if ok == false || c == 0 {
+			return false
+		}
+		m[v]--
+	}
+	return true
+}

409. Longest Palindrome.go

@@ -0,0 +1,16 @@
+package main
+
+func longestPalindrome(s string) int {
+	count := make([]int, 128)
+	for _, c := range s {
+		count[c]++
+	}
+	ans := 0
+	for _, v := range count {
+		ans += v / 2 * 2
+		if ans%2 == 0 && v%2 == 1 {
+			ans++
+		}
+	}
+	return ans
+}

434. Number of Segments in a String.go

@@ -5,7 +5,7 @@ func countSegments(s string) int {
 	count := 1
 	found := false
 	for i := 0; i < len(s); i++ {
-		if i > 0 && s[i] == ' ' && s[i+1] != ' ' {
+		if i > 0 && s[i] == ' ' && s[i-1] != ' ' {
 			count++
 		}
 		if s[i] != ' ' {

442. Find All Duplicates in an Array.go

@@ -0,0 +1,20 @@
+package main
+
+func findDuplicates(nums []int) []int {
+
+	m := make(map[int]int)
+	for _, v := range nums {
+		if _, ok := m[v]; ok {
+			m[v]++
+		} else {
+			m[v] = 1
+		}
+	}
+	ret := []int{}
+	for k, v := range m {
+		if v == 2 {
+			ret = append(ret, k)
+		}
+	}
+	return ret
+}