Commit 067f198

committed

rename java

1 parent e871d4a commit 067f198Copy full SHA for 067f198

File tree

+10

-6

lines changed

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

+10

-6

lines changed

0 Bytes

Binary file not shown.

Lines changed: 5 additions & 1 deletion

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,22 +8,22 @@ import "fmt"`
`8`	`8`	`* 思路1:2次哈希求解:将数组放入散列表,遍历散列表,通过target-key得出匹配数组,并且判断非自身元素,返回数组,时间复杂度 O(n)`
`9`	`9`	`* 思路2[runtime beats(最优解)]:1次哈希求解:在遍历 num 数组,如果哈希表不包含 target - num[i] ,则将 num[i], i 放入哈希表,如果包含则直接返回 [hash[num[i], i]] 下标`
`10`	`10`	`*/`
`11`		`-func twoSum(nums []int, target int) []int {`
	`11`	`+func twoSum(nums []int, target int) []int {`
`12`	`12`	`hashMap := map[int]int{}`
`13`	`13`	`for i := 0; i < len(nums); i++ {`
`14`		`- p, ok := hashMap[target-nums[i]]`
	`14`	`+ p, ok := hashMap[target-nums[i]]`
`15`	`15`	`if ok {`
`16`	`16`	`return []int{p, i}`
`17`	`17`	`}`
`18`	`18`	`hashMap[nums[i]] = i`
`19`	`19`	`}`
`20`	`20`	`return nil`
`21`		`-}`
	`21`	`+}`
`22`	`22`
`23`	`23`	`func main() {`
`24`		`- // 声明 slice`
	`24`	`+ // 声明 slice`
`25`	`25`	`nums := []int{2, 7, 11, 15}`
`26`	`26`	`target := 9`
`27`	`27`	`p := twoSum(nums, target)`
`28`	`28`	`fmt.Println("p value:", p)`
`29`		`-}`
	`29`	`+}`