8、go语言的map

概览

创建：make( map[string]int)
获取：m[key]
key不存在时，获取value类型的初始值
用 value, ok := m[key]来判断是否存在key
用delete函数删除一个key
用range遍历map，但是不保证遍历顺序，如需顺序需手动对key排序
使用len函数获得元素个数
map使用哈希表，必须可以比较相等
除了slice，map，function的内建类型，其他都可作为key
Struct类型不包含上述字段，也可作为key

定义map

//方式1
m := map[string]string {
	"name" : "xiaoming",
	"age" : "27"
}
//方式2
m2 := make(map[string]int) //m2 == empty map
//方式3
var m3 map[string]int // m3 == nil
//复合map
map[key1_type]value1_type,map[key2_type]value2_type

map遍历

m := map[string] string {
	"name" : "xiahong",
	"age" : "10"
	"sex" : "1"
}
for k, v := range m {
	fmt.Println(k, v)
}
for k := range m {
	fmt.Println(k)
}
for _,v := range m {
	fmt.Println(v)
}

获取value

m := map[string]string {
	"name" : "xiaohong"
}
m_name := m["name"] // m_name == xiaohong
m_age := m["age"] // m_age为空串，不会报错

判断value是否存在

m := map[string]string {
	"name" : "xiaohong",
	"age" : "27"
}
m_name, ok := m["name"] // m_name == xiaohong ok == true
m_sex, ok := m["sex"] // m_sex为空串 ok == false
if uname, ok := m["name"]; ok {
	fmt.Println("name存在")
} else {
	fmt.Println("name未设置")
}

删除value

m := map[string]string {
	"name" : "xiaohong",
	"age" : "27"
}
name, ok := m["name"]
fmt.Println(name, m)// xiaohong true

delete(m, "name")
name, ok = m["name"]
fmt.Println(name, m) //

算法题

求最长不含有重复字符串的子串长度

package main

import "fmt"

func lengthOfNonRepeatingSubStr(s string) int {
	lastOccurred := make(map[byte]int)
	start := 0
	maxLength := 0
	for i, ch := range []byte(s) {
		lastI, ok := lastOccurred[ch]
		if ok && lastI >= start {
			start = lastI + 1
		}
		if i-start+1 > maxLength {
			maxLength = i - start + 1
		}
		lastOccurred[ch] = i
	}
	return maxLength
}
func main() {

	fmt.Print(lengthOfNonRepeatingSubStr("a1bc"))
}