day26|● 332.重新安排行程 ● 51. N皇后 ● 37. 解数独

332.重新安排行程

go中的map[string]map[string]int类型需要先make一个map[string]int，然后才能赋值才可以。

for i := 0; i < len(tickets); i++ {
				if myMap[tickets[i][0]] == nil{
					myMap[tickets[i][0]] = make(map[string]int)
				}
				
        myMap[tickets[i][0]][tickets[i][1]]++
	}

func findItinerary(tickets [][]string) []string {
	result := []string{}
	// map[出发机场] pair{目的地,是否被访问过}
    var myMap map[string]map[string]int
		myMap = make(map[string]map[string]int)
	
	for i := 0; i < len(tickets); i++ {
				if myMap[tickets[i][0]] == nil{
					myMap[tickets[i][0]] = make(map[string]int)
				}
				
        myMap[tickets[i][0]][tickets[i][1]]++
	}
	fmt.Print(myMap["ATL"]["JFK"])
	result = append(result, "JFK")
	var backtracking func() bool
	backtracking = func() bool {
		if len(tickets)+1 == len(result) {
			return true
		}
		// 取出起飞航班对应的目的地
		tmplist := make([]string, 0)
		for key, _ := range myMap[result[len(result)-1]]{
			tmplist = append(tmplist, key)
		}
		sort.Strings(tmplist)
		
		for i:= 0; i < len(tmplist); i++ {
			if myMap[result[len(result)-1]][tmplist[i]] > 0 {
					
				myMap[result[len(result)-1]][tmplist[i]]--
				result = append(result, tmplist[i])
				
				if backtracking() {
					return true
				}
				result = result[:len(result)-1]
				myMap[result[len(result)-1]][tmplist[i]]++
				
			}
		}
		return false
	}

	backtracking()

	return result
}

51. N皇后

n皇后问题，首先是要维持一个判断函数，分别要判断列、45、135是否满足条件呢，不需要判断行是因为行在每次迭代中都满足只有一个。
之后就是迭代中维护一个行，当到了最后一行后进行返回。

func solveNQueens(n int) [][]string {
    queue := make([][]byte, 0)
    for i := 0; i < n; i++{
        tmp := make([]byte, 0)
        for i := 0; i < n; i++{
            tmp = append(tmp, '.')
        }
        queue = append(queue, tmp)
    }

    ret := make([][]string, 0)
    var build func(row int)
    build = func(row int){
        if row == n{
            tmp := make([]string, 0)
            for i := 0; i < n; i++{
                tmp = append(tmp, string(queue[i]))
            }
            ret = append(ret, append([]string(nil), tmp...))
            return
        }
        for i := 0; i < n; i++{
            queue[row][i] = 'Q'
            if istrue(queue, row, i){
                build(row + 1)
            }
            queue[row][i] = '.'
        }
    }
    build(0)
    return ret
    
}

func istrue(queue [][]byte, row , col int) bool{
    for i := 0; i < row; i++{
        if queue[i][col] == 'Q'{
            return false
        }
    }
    for i, j := row - 1 , col - 1; i>= 0 && j >= 0; i, j = i - 1, j - 1{
        if queue[i][j] == 'Q'{
            return false
        }
    }

    for i, j := row - 1, col + 1; i >= 0 && j < len(queue); i,j = i - 1, j+1{
        if queue[i][j] == 'Q'{
            return false
        }
    }
    return true
}

37. 解数独

这个比n皇后要多一个维度，因为行和列都需要进行查询。

func solveSudoku(board [][]byte) {
	var backtracking func(board [][]byte) bool
	backtracking = func(board [][]byte) bool {
		for i := 0; i < 9; i++ {
			for j := 0; j < 9; j++ {
				//判断此位置是否适合填数字
				if board[i][j] != '.' {
					continue
				}
				//尝试填1-9
				for k := '1'; k <= '9'; k++ {
					if isvalid(i, j, byte(k), board) == true { //如果满足要求就填
						board[i][j] = byte(k)
						if backtracking(board) == true {
							return true
						}
						board[i][j] = '.'
					}
				}
				return false
			}
		}
		return true
	}
	backtracking(board)
}

//判断填入数字是否满足要求
func isvalid(row, col int, k byte, board [][]byte) bool {
	for i := 0; i < 9; i++ { //行
		if board[row][i] == k {
			return false
		}
	}
	for i := 0; i < 9; i++ { //列
		if board[i][col] == k {
			return false
		}
	}
	//方格
	startrow := (row / 3) * 3
	startcol := (col / 3) * 3
	for i := startrow; i < startrow+3; i++ {
		for j := startcol; j < startcol+3; j++ {
			if board[i][j] == k {
				return false
			}
		}
	}
	return true
}