126 改进了一处细节，269ms -> 272ms

aQua · aQua · commit f9346f4c927f · 2017-09-15T22:39:02.000+08:00
diff --git a/Algorithms/0126.word-ladder-ii/word-ladder-ii.go b/Algorithms/0126.word-ladder-ii/word-ladder-ii.go
@@ -102,18 +102,19 @@ func deepCopy(src []string) []string {
 // 题目中说了，words 中没有重复的单词，
 // 所以，beginWord 最多出现一次
 func deleteBeginWord(words []string, beginWord string) []string {
-	i := 0
-	for ; i < len(words); i++ {
+	i, size := 0, len(words)
+	for ; i < size; i++ {
 		if words[i] == beginWord {
 			break
 		}
 	}
 
-	if i == len(words) {
+	if i == size {
 		return words
 	}
 
-	return append(words[:i], words[i+1:]...)
+	words[i] = words[size-1]
+	return words[:size-1]
 }
 
 func isTransable(a, b string) bool {

Original file line number	Diff line number	Diff line change
`@@ -102,18 +102,19 @@ func deepCopy(src []string) []string {`
`102`	`102`	`// 题目中说了，words 中没有重复的单词，`
`103`	`103`	`// 所以，beginWord 最多出现一次`
`104`	`104`	`func deleteBeginWord(words []string, beginWord string) []string {`
`105`		`- i := 0`
`106`		`- for ; i < len(words); i++ {`
	`105`	`+ i, size := 0, len(words)`
	`106`	`+ for ; i < size; i++ {`
`107`	`107`	`if words[i] == beginWord {`
`108`	`108`	`break`
`109`	`109`	`}`
`110`	`110`	`}`
`111`	`111`
`112`		`- if i == len(words) {`
	`112`	`+ if i == size {`
`113`	`113`	`return words`
`114`	`114`	`}`
`115`	`115`
`116`		`- return append(words[:i], words[i+1:]...)`
	`116`	`+ words[i] = words[size-1]`
	`117`	`+ return words[:size-1]`
`117`	`118`	`}`
`118`	`119`
`119`	`120`	`func isTransable(a, b string) bool {`