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

4 votes203 views2 answers
How to create a gui in java
Java
0 vote215 views1 answer
Minecraft inventory share plugin
Java
1 vote190 views1 answer
Java check if args is empty
Java
0 vote190 views2 answers
Java program for calendar using applet
Java
0 vote200 views5 answers
ArrayList
Java
2 votes189 views1 answer
Java random unique number
Java
0 vote191 views2 answers
Abstract class java
Java
1 vote229 views1 answer
Java download 64-bit
Java
0 vote179 views1 answer
Previous method in jdbc
Java
0 vote194 views1 answer
Javafx check if enter pressed
Java