Sibling search java program

  public int[] getSiblings(int[] arr, int x) {
    int pos = 0;
    for (int i = 0; i < arr.length; i++) {
      if(arr[i]==x) pos = i+1;
    }
    int start = Integer.highestOneBit(pos); // get max power of 2
    int end = start*2-1 >= arr.length ? arr.length: start*2-1;
    return IntStream.range(start-1, end).map(i -> arr[i]).filter(v -> v!=x).toArray();
  }

Source: stackoverflow.com

Similar codes

0 vote275 views10 answers
Arrays with for loops
Java
0 vote357 views1 answer
Java android development find element by id
Java
0 vote313 views1 answer
Spring application configuration example
Java
14 votes297 views2 answers
Java 11 initialize map
Java
0 vote369 views1 answer
Junit vintage engine maven
Java
0 vote300 views1 answer
LayerRenderer
Java
-1 vote348 views1 answer
Get spring application context
Java Spring
0 vote307 views1 answer
Resultset methods in jdbc
Java
2 votes299 views1 answer
Zufallszahlen in java
Java
0 vote284 views1 answer
.code domain
Java