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 vote164 views1 answer
Keep jframe on top
Java
1 vote141 views1 answer
How to find the largest number in a 2d array java
Java
1 vote195 views1 answer
Not supported for DML operations
Java
1 vote134 views2 answers
Java template string
Java
0 vote130 views1 answer
Java benchmark time
Java
0 vote196 views1 answer
How to use setonclicklistener from custom view in android
Java
0 vote221 views1 answer
How to add classpath in spring boot
Java Spring
11 votes153 views4 answers
List of strings java
Java
0 vote142 views2 answers
Boolean checkbox swing
Java
0 vote166 views2 answers
Java draw image
Java