Commitf722358

committed

add TODO notes

1 parentcf3fd79 commitf722358Copy full SHA for f722358

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -21,7 +21,7 @@ Your algorithm should run in O(n2) complexity.`
`21`	`21`	`Credits:`
`22`	`22`	`Special thanks to @pbrother for adding this problem and creating all test cases.*/`
`23`	`23`	`publicclassLengthIncreasingSubsequence {`
`24`		`-`
	`24`	`+//TODO: completely understand the following approach and study other good solutions, this is a MUST!!! LIS is a very commonly seen interview question`
`25`	`25`	`publicintlengthOfLIS_using_binary_search_from_discuss(int[]nums) {`
`26`	`26`	`/**Java doc for this Arrays.binarySearch method:`
`27`	`27`	`* int java.util.Arrays.binarySearch(int[] a, int fromIndex, int toIndex, int key)`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -17,6 +17,8 @@`
`17`	`17`	`*/`
`18`	`18`	`publicclassSingleNumberII {`
`19`	`19`
	`20`	`+//TODO: study its bit manipulation approach, this is a MUST!`
	`21`	`+`
`20`	`22`	`publicintsingleNumber(int[]nums) {`
`21`	`23`	`Map<Integer,Integer>map =newHashMap();`
`22`	`24`	`for(inti :nums){`

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,6 +18,9 @@`
`18`	`18`	`Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?`
`19`	`19`	`*/`
`20`	`20`	`publicclassSingleNumberIII {`
	`21`	`+// TODO: study its bit manipulation way, this is a MUST!`
	`22`	`+`
	`23`	`+`
`21`	`24`	`//Approach 1: normal hashmap`
`22`	`25`	`publicint[]singleNumber(int[]nums) {`
`23`	`26`	`Map<Integer,Integer>map =newHashMap();`

Comments

(0)