updated Java solution for First_missing

2000shivam659 · 2000shivam659 · commit 08dd85e2b26b · 2021-10-03T01:07:10.000+05:30
diff --git a/LeetCode/First Missing Positive.java b/LeetCode/First Missing Positive.java
@@ -26,7 +26,7 @@ public static int firstMissingPositive(int[] nums) {
             while(nums[i] > 0 && nums[i] <= n && nums[nums[i] - 1] != nums[i]) {
                 int temp1 = nums[i];
                 int temp2 = nums[nums[i] - 1];
-                nums[i] = te;
+                nums[i] = temp2;
                 nums[temp1 - 1] = temp1;
             }
 

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@ public static int firstMissingPositive(int[] nums) {`
`26`	`26`	`while(nums[i] > 0 && nums[i] <= n && nums[nums[i] - 1] != nums[i]) {`
`27`	`27`	`int temp1 = nums[i];`
`28`	`28`	`int temp2 = nums[nums[i] - 1];`
`29`		`- nums[i] = te;`
	`29`	`+ nums[i] = temp2;`
`30`	`30`	`nums[temp1 - 1] = temp1;`
`31`	`31`	`}`
`32`	`32`