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 vote233 views1 answer
Seekbar thumb position
Java
0 vote229 views2 answers
Spring boot base url
Java
2 votes229 views1 answer
Java list get index
Java
0 vote241 views1 answer
Java check if year is leap
Java
0 vote247 views2 answers
Raspberry stackexchange how to install the java jdk
Java
1 vote242 views1 answer
Load a file from classpath spring boot
Java
3 votes218 views1 answer
Java console write
Java
0 vote242 views1 answer
9999999999999
Java
3 votes233 views1 answer
Java android studio int to string
Java
0 vote237 views1 answer
How to add an image to a gui in java windowbuilder
Java