Need an optimised Map(k,v) e.g. (long, long[]), to avoid auto boxing

后端 未结 0 453
迷失自我
迷失自我 2020-12-21 20:22

I have a piece of code which is basically as followed:

long[]   ids;
long[][] values;

The values are filled out of turn i.e. if ids

相关标签:
回答
  • 消灭零回复
提交回复
热议问题