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 vote178 views1 answer
Add integers java
Java
4 votes222 views4 answers
Java arraylist declaration
Java
1 vote171 views1 answer
"java.lang.NoClassDefFoundError: org/yaml/snakeyaml/LoaderOptions"
Java
1 vote197 views1 answer
Java mouseclick
Java
0 vote176 views1 answer
Java empty a combobox
Java
1 vote124 views1 answer
Number to char
Java
0 vote176 views1 answer
Android dynamically create layer-list with item and shape site:stackoverflow.com
Java
0 vote177 views1 answer
Class syntax in java
Java
1 vote188 views1 answer
Java collection to list
Java
0 vote217 views1 answer
Fhow to find location of java jdk
Java