Yogourta
BAN USERpublic void rearrange() {
Node pointer1 = head;
Node pointer2 = head.next;
Node temp;
pointer1.next = pointer2.next;
pointer2.next = pointer1;
head = pointer2;
while(pointer1.next != null && pointer1.next.next != null) {
temp = pointer1;
pointer1 = temp.next;
pointer2 = pointer1.next;
pointer1.next = pointer2.next;
pointer2.next = pointer1;
temp.next = pointer2;
}
print();
}
void occurences(int[] a) {
int count = 0;
int last = 0;
for (int i = 0; i < a.length; i++) {
if (i == 0) {
last = a[i];
count++;
} else if (a[i] == last) {
count++;
} else {
System.out.println(last + " : " + count);
count = 1;
last = a[i];
}
if (i == a.length - 1) System.out.println(last + " : " + count);
}
}
void reverseSentence(String s) {
ArrayList<String> list = new ArrayList<>();
String word = "";
for(int i = 0; i < s.length(); i++) {
if (s.charAt(i) != ' ') {
word += s.charAt(i);
} else {
list.add(word);
word = "";
}
if (i == s.length() - 1) list.add(word);
}
word = "";
for(int i = list.size() - 1; i >= 0; i--) {
word += list.get(i);
if (i > 0) word += " ";
}
System.out.println(word);
}
- Yogourta June 04, 2018int findPivot(int[] arr, int min, int max) {
if (arr.length == 0) return -1;
if (arr.length == 1) return 0;
int mid = (max - min) / 2 + min;
if (arr[mid] > arr[mid + 1]) {
return mid;
}
if (arr[min] < arr[mid]) {
return findPivot(arr, mid + 1, max);
}
return findPivot(arr, min, mid);
}
int binarySearch(int[] arr, int num, int min, int max) {
if (arr.length == 0) return -1;
if (arr.length == 1) return arr[0];
int mid = (max - min) / 2 + min;
if (arr[mid] == num) return mid;
if (arr[mid] < num) return binarySearch(arr, num, mid + 1, max);
return binarySearch(arr, num, min, mid);
}
int findInRotArr(int[] a, int num) {
int pivot = findPivot(a, 0, a.length);
if (a[pivot] == num) return pivot;
if (a[pivot] > num && a[a.length - 1] > num) return binarySearch(a, num,pivot + 1, a.length);
if (a[pivot] > num && a[a.length - 1] < num) return binarySearch(a, num, 0, pivot);
return binarySearch(a, num, pivot + 1, a.length);
}
- Yogourta May 30, 2018boolean countPatterns(String s, String p){
int count = 0;
for (int i = 0; i < s.length() - (p.length() - 1); i++) {
if (s.charAt(i) == p.charAt(0)) {
if (s.substring(i, p.length() + i).equals(p)) {
return true;
}
}
}
return false;
}
void countInText(String[] s, String p) {
for(int i = 0; i < s.length; i++) {
if (countPatterns(s[i], p)) {
System.out.println(s[i]);
}
}
}
- Yogourta May 30, 2018void inorder(Node node, ArrayList nodes) {
if (node != null) {
inorder(node.left, nodes);
nodes.add(node.value);
inorder(node.right, nodes);
}
}
boolean isBST(ArrayList<Integer> inorder) {
for(int i = 0; i < inorder.size() - 1; i++) {
if (inorder.get(0).compareTo(inorder.get(i + 1)) > 0){
return false;
}
}
return true;
}
int zeros2Right(int[] a) {
int countZeros = 0;
int bIndex = 0;
int[] b = new int[a.length + 1];
for (int i = 0; i < a.length; i++) {
if (a[i] != 0) {
b[bIndex] = a[i];
bIndex++;
} else {
countZeros++;
}
}
a = b;
System.out.println(Arrays.toString(a));
return a.length - countZeros - 1;
}
- Yogourta June 06, 2018