Spring Boot - OAuth2
- http://javainuse.com/spring/spring-boot-oauth-authorization-code
.parallel() can be used for parallel operations.
public class Node {
int data;
Node left;
Node right;
public Node(int data) {
this.data = data;
}
public void insert(int value) {
if (value <= data) {
// inserting if left node is free
if (left == null) {
left = new Node(value);
} else {
// forward to next node if left node aleady occupied.
left.insert(value);
}
} else {
if (right == null) {
right = new Node(value);
} else {
right.insert(value);
}
}
}
public boolean contains(int value) {
if (data == value) {
return true;
} else if (value < data) {
if (left == null) {
return false;
} else {
left.contains(value);
}
} else {
if (right == null) {
return false;
} else {
right.contains(value);
}
}
return false;
}
public void inOrderPrinting() {
if (left != null) {
left.inOrderPrinting();
}
System.out.println(data);
if (right != null) {
right.inOrderPrinting();
}
}
}
public void bubbleSort() {
int temp, firstValue, secondValue;
int[] arr = { 1, 90, 25, 22, 4, 50 };
printArray(arr);
for (int i = 0; i < arr.length; i++) {
// #arr.length - 2 -- avoids next index of last index -- secondValue
for (int j = 0; j < arr.length - 2; j++) {
firstValue = arr[j];
secondValue = arr[j + 1];
if ((firstValue > secondValue)) {
temp = firstValue;
arr[j] = secondValue;
arr[j + 1] = temp;
}
}
}
System.out.println("-----SORTING DONE-----");
printArray(arr);
}
public String linearSearchForValue(int value) {
String indexesWithValue = "";
for (int i = 0; i < size; i++) {
if (theArray[i] == value) {
indexesWithValue += i + " ,";
}
}
return indexesWithValue;
}
50 36 22
31 88 87
27 73 95
50
31 36
27 88 22
73 87
95
50
31 36
27 88 22
73 87
95
public class TraveseMatrixDiagonally {
private static final int M = 4;
private static final int N = 4;
public static void main(String[] args) {
TraveseMatrixDiagonally app = new TraveseMatrixDiagonally();
int[][] matrix = app.createMatrix();
app.printMatrix(matrix);
app.traverseDiagonally(matrix);
}
private void traverseDiagonally(int[][] matrix) {
for (int i = 0; i <= M - 1; i++) {
int X = i; // temp M
int Y = 0; // temp N
while (X >= 0 && Y <= N - 1) {
System.out.print(matrix[X][Y] + " ");
X = X - 1;
Y = Y + 1;
}
System.out.println(" ");
}
for (int i = 1; i <= N - 1; i++) {
int X = M - 1;
int Y = i;
while (X >= 0 && Y <= N - 1) {
System.out.print(matrix[X][Y] + " ");
X = X - 1;
Y = Y + 1;
}
System.out.println(" ");
}
}
private int[][] createMatrix() {
int matrix[][] = new int[M][N];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
matrix[i][j] = (int) ((Math.random() * (99 + 1 - 10)) + 10);
}
}
return matrix;
}
private void printMatrix(int[][] matrix) {
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
System.out.print(matrix[i][j]);
System.out.print(" ");
}
System.out.println(" ");
}
}
}
/*
****** SAMPLE INPUT ********
61 44 88
74 44 32
86 56 92
******* INPUT ********
****** SAMPLE OUTPUT ********
61
74 44
86 44 88
56 32
92
******* OUTPUT ********
*/
package com.sk.iwq.matrix;
public class TraverseMatrixSpiral {
private static final int M = 3;
private static final int N = 3;
public static void main(String[] args) {
TraverseMatrixSpiral app = new TraverseMatrixSpiral();
int matrix[][] = app.createMatrix();
app.printMatrix(matrix);
System.out.println(app.traverseSpriral(matrix).toString());
}
private StringBuilder traverseSpriral(int[][] matrix) {
StringBuilder sb = new StringBuilder();
int dir = 0;
int t = 0;
int b = M - 1;
int l = 0;
int r = N - 1;
while (t <= b && l <= r) {
if (dir == 0) {
for (int i = l; i <= r; i++) {
sb.append(matrix[t][i] + ", ");
}
t++;
}
if (dir == 1) {
for (int i = t; i <= b; i++) {
sb.append(matrix[i][r] + ", ");
}
r--;
}
if (dir == 2) {
for (int i = r; i >= l; i--) {
sb.append(matrix[b][i] + ", ");
}
b--;
}
if (dir == 3) {
for (int i = b; i <= t; i++) {
sb.append(matrix[i][l] + ", ");
}
l++;
}
dir = (dir + 1) % 4;
}
return sb;
}
private int[][] createMatrix() {
int matrix[][] = new int[M][N];
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
matrix[i][j] = (int) (Math.random() * 100 + 1);
}
}
return matrix;
}
private void printMatrix(int[][] matrix) {
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
System.out.print(matrix[i][j]);
System.out.print(" ");
}
System.out.println(" ");
}
}
}
/*
****** SAMPLE INPUT ********
50 36 22
31 88 87
27 73 95
******* INPUT ********
****** SAMPLE OUTPUT ********
50, 36, 22, 87, 95, 73, 27, 31, 88
******* OUTPUT ********
*/