Commit8532f8c

authored

Improved task 1

1 parent7a80b30 commit8532f8cCopy full SHA for 8532f8c

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ You can return the answer in any order.`
`14`	`14`
`15`	`15`	`Output:[0,1]`
`16`	`16`
`17`		`-Output: Because nums[0] + nums[1] == 9, we return[0, 1].`
	`17`	`+Explanation: Because nums[0] + nums[1] == 9, we return[0, 1].`
`18`	`18`
`19`	`19`	`Example 2:`
`20`	`20`
`@@ -35,4 +35,4 @@ You can return the answer in any order.`
`35`	`35`	`* <code>-10<sup>9</sup> <= target <= 10<sup>9</sup></code>`
`36`	`36`	`*Only one valid answer exists.`
`37`	`37`
`38`		`-Follow-up: Can you come up with an algorithm that is less than <code>O(n<sup>2</sup>)</code>time complexity?`
	`38`	`+Follow-up: Can you come up with an algorithm that is less than <code>O(n<sup>2</sup>)</code>time complexity?`

Comments

(0)