mirror
/
java-interview
mirror of https://github.com/enhorse/java-interview.git
1
1
Fork 0
Code

Фикс форматирования кода

This commit is contained in:
Arthur 2020-02-21 17:24:18 +03:00 committed by Enchased Horse
parent 4641b59de9
commit ea8888d046
1 changed files with 36 additions and 36 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

72
jcf.md
View File

@ -656,52 +656,52 @@ import java.util.Map;
public class Q {
public static void main(String[] args) {
public static void main(String[] args) {
Q q = new Q();
q.binSearch();
Q q = new Q();
q.binSearch();
}
}
private void binSearch() {
private void binSearch() {
int inpArr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int inpArr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
Integer result = binSearchF(inpArr, 1, 0, inpArr.length - 1);
System.out.println("-----------------------");
result = binSearchF(inpArr, 2, 0, inpArr.length - 1);
Integer result = binSearchF(inpArr, 1, 0, inpArr.length - 1);
System.out.println("-----------------------");
result = binSearchF(inpArr, 2, 0, inpArr.length - 1);
System.out.println("Found at position " + result);
System.out.println("Found at position " + result);
}
}
private Integer binSearchF(int inpArr[], int searchValue, int low, int high) {
private Integer binSearchF(int inpArr[], int searchValue, int low, int high) {
Integer index = null;
while (low <= high) {
System.out.println("New iteration, low = " + low + ", high = " + high);
Integer index = null;
while (low <= high) {
System.out.println("New iteration, low = " + low + ", high = " + high);
int mid = (low + high) / 2;
System.out.println("trying mid = " + mid + " inpArr[mid] = " + inpArr[mid]);
int mid = (low + high) / 2;
System.out.println("trying mid = " + mid + " inpArr[mid] = " + inpArr[mid]);
if (inpArr[mid] < searchValue) {
low = mid + 1;
System.out.println("inpArr[mid] (" + inpArr[mid] + ") < searchValue(" + searchValue + "), mid = " + mid
+ ", setting low = " + low);
} else if (inpArr[mid] > searchValue) {
high = mid - 1;
System.out.println("inpArr[mid] (" + inpArr[mid] + ") > searchValue(" + searchValue + "), mid = " + mid
+ ", setting high = " + high);
} else if (inpArr[mid] == searchValue) {
index = mid;
System.out.println("found at index " + mid);
break;
}
if (inpArr[mid] < searchValue) {
low = mid + 1;
System.out.println("inpArr[mid] (" + inpArr[mid] + ") < searchValue(" + searchValue + "), mid = " + mid
+ ", setting low = " + low);
} else if (inpArr[mid] > searchValue) {
high = mid - 1;
System.out.println("inpArr[mid] (" + inpArr[mid] + ") > searchValue(" + searchValue + "), mid = " + mid
+ ", setting high = " + high);
} else if (inpArr[mid] == searchValue) {
index = mid;
System.out.println("found at index " + mid);
break;
}
}
}
return index;
}
return index;
}
}
```
@ -827,8 +827,8 @@ for (int i = 0; i < list.size(); i++) {
```java
int i = 0;
while (i < list.size()) {
//list.get(i);
i++;
//list.get(i);
i++;
}
```
@ -836,7 +836,7 @@ while (i < list.size()) {
```java
for (String element : list) {
//element;
//element;
}
```