comefrom: <qiyuangong>1310_XOR_Queries_of_a_Subarray_1.java
code: public int[] xorQueries(int[] arr, int[][] queries) {
          int[] res = new int[queries.length], q;
          for (int i = 1; i < arr.length; i++)
              arr[i] ^= arr[i - 1];
          for (int i = 0; i < queries.length; i++) {
              q = queries[i];
              res[i] = q[0] > 0 ? arr[q[0] - 1] ^ arr[q[1]] : arr[q[1]];
          }
          return res;
      }
masked: public int [ ] sample_funcname ( int [ ] var_0 , int [ ] [ ] var_1 ) {
    int [ ] var_3 = new int [ var_1 . length ] , var_4 ;
    for ( int var_6 = 1 ;
    var_6 < var_0 . length ;
    var_6 ++ ) var_0 [ var_6 ] ^= var_0 [ var_6 - 1 ] ;
    for ( int var_6 = 0 ;
    var_6 < var_1 . length ;
    var_6 ++ ) {
      var_4 = var_1 [ var_6 ] ;
      var_3 [ var_6 ] = var_4 [ 0 ] > 0 ? var_0 [ var_4 [ 0 ] - 1 ] ^ var_0 [ var_4 [ 1 ] ] : var_0 [ var_4 [ 1 ] ] ;
    }
    return var_3 ;
  }
  