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 vote270 views3 answers
Call method without creating object java
Java
0 vote274 views1 answer
How to encrypt password in properties file in spring boot
Java
0 vote299 views1 answer
Register command spigot
Java
-1 vote279 views1 answer
MapToString in java
Java
0 vote276 views1 answer
Kingkaihockey
Java
3 votes292 views2 answers
Android round double to 2 decimal
Java
0 vote273 views1 answer
Ubuntu java compiler version
Java
0 vote263 views1 answer
Return class name java
Java
0 vote284 views1 answer
Do function after time android studio
Java
0 vote273 views1 answer
Assert multiple junit
Java