深度優(yōu)先
- 問題描述：這是一道似曾相識的小學(xué)奧數(shù)題
_._._ + _._._ = _._._將1～9數(shù)字填入到等式并使等式成立 - 樣例：173+286=459
問題轉(zhuǎn)化：借助N數(shù)全排的思想冰悠，這個(gè)問題和全排問題一直堡妒，只需要找出1～9在這9個(gè)位置的全排，并判斷等式的有效性即可溉卓。
func DeepFirstSearch(step int) {
if step == n {
if ((locations[0]+locations[3])*100 + (locations[1]+locations[4])*10 + locations[2] + locations[5]) == (locations[6]*100 + locations[7]*10 + locations[8]) {
fmt.Println(locations[0:3], " + ", locations[3:6], " = ", locations[6:9])
}
return
}
for i := 0; i < n; i++ {
if 0 == marks[i] {
locations[step] = i
marks[i] = 1
DeepFirstSearch2(step + 1)
marks[i] = 0
}
}
return
}
結(jié)果
