Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 8736fd0

Browse files
committed
Corrected the invalid answer: Have implemented the program to find whether the array can be made strictly increasing using the values from another array.
1 parent 1b9726c commit 8736fd0

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/com/raj/MakeArrayStrictlyIncreasing.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -43,7 +43,7 @@ public static void main(String[] args) {
4343
// Sort the option array.
4444
Arrays.sort(arr2);
4545
// Check for the first index.
46-
if (arr1[0] >= arr2[1]) {
46+
if (arr1[0] >= arr1[1]) {
4747
boolean isValueFounded = false;
4848
for (int j : arr2) {
4949
if (arr1[1] > j) {

0 commit comments

Comments
 (0)