Update the space complexity comment

rayworks · rayworks · commit a0fe73610e98 · 2021-03-10T18:36:07.000+08:00
diff --git a/src/main/java/org/sean/array/MissingPositiveFinder.java b/src/main/java/org/sean/array/MissingPositiveFinder.java
@@ -68,7 +68,7 @@ private void swap(int[] nums, int i, int j) {
         nums[j] = t;
     }
 
-    public int firstMissingPositive0(int[] nums) { // O(N) time | O(1) space
+    public int firstMissingPositive0(int[] nums) { // O(N) time | O(N) space
         if (nums == null || nums.length == 0) return 1;
 
         Set<Integer> set = new HashSet<>();

Original file line number	Diff line number	Diff line change
`@@ -68,7 +68,7 @@ private void swap(int[] nums, int i, int j) {`
`68`	`68`	`nums[j] = t;`
`69`	`69`	`}`
`70`	`70`
`71`		`- public int firstMissingPositive0(int[] nums) { // O(N) time \| O(1) space`
	`71`	`+ public int firstMissingPositive0(int[] nums) { // O(N) time \| O(N) space`
`72`	`72`	`if (nums == null \|\| nums.length == 0) return 1;`
`73`	`73`
`74`	`74`	`Set<Integer> set = new HashSet<>();`