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 vote154 views1 answer
Java number padding zeros
Java
14 votes188 views4 answers
Java create txt file
Java
0 vote161 views1 answer
Java convert edittext to double
Java
0 vote150 views1 answer
How to draw a circle in java swing
Java
0 vote154 views1 answer
Spring valid request body custom message
Java
0 vote161 views1 answer
A?che les paramètres de la ligne de commande triés par ordre lexicographique en java
Java
3 votes152 views1 answer
Ternary operator java
Java
0 vote149 views1 answer
How to get system date in android
Java
0 vote160 views1 answer
Difference between offer and add in linkedlist in java
Java
0 vote111 views1 answer
How to clear the consol after input java
Java