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 vote287 views1 answer
Grepper mcm java
Java
12 votes221 views1 answer
Java get string from after first character
Java
0 vote285 views1 answer
Putting scanner into an array
Java
0 vote266 views1 answer
Convert class to xml string
Java
0 vote279 views1 answer
Difference between maven and cucumber test runner
Java
2 votes276 views1 answer
Jlabel on the center of a jpanel
Java
0 vote220 views1 answer
Converting list to array in java
Java
1 vote253 views1 answer
Afficher texte java
Java
0 vote285 views1 answer
Org.apache.hadoop.mapred.JobClient.runJob(JobClient.java:876)
Java
1 vote265 views1 answer
Java parse string to list using gson
Java