[Java] Potentially inefficient variable-width vector reallocation

In several places in the Java codebase you can see this kind of pattern:
```java

while (vector.getDataBuffer().capacity() < toCapacity) {
vector.reallocDataBuffer();
}
```

In the event that a much larger capacity is requested, this will spuriously make several reallocations (doubling the capacity each time).

It would probably be more efficient to reallocate directly to satisfy the desired capacity.

Coincidentally, there's a `reallocDataBuffer` overload that seems to do just that.

**Reporter**: [Antoine Pitrou](https://issues.apache.org/jira/browse/ARROW-17919) / @pitrou

_{**Note**: *This issue was originally created as [ARROW-17919](https://issues.apache.org/jira/browse/ARROW-17919). Please see the [migration documentation](https://github.com/apache/arrow/issues/14542) for further details.*}

先找出會迴圈處理 vector.getDataBuffer().capacity() 並呼叫 reallocDataBuffer() 的 Java 呼叫點，接著檢查接受所需容量的 reallocDataBuffer 多載。更新受影響的路徑，讓要求的較大容量能直接獲得滿足，並確認相關的 Java 測試涵蓋重新配置行為。

由索引模型根據 Issue 內容生成。