有人可以提供一个详细的例子,说明我如何使用antlr4做到这一点?安装antlr4及其依赖项的说明将受到高度赞赏.
给定一个数组A,从索引0到n-1哪里n是数组的大小,以及一系列形式的查询,i j其中,i与j指示指数(i和j包容性的),我该如何找出哪些指数已经查询数量最多的有效时间?
例如,考虑一个数组 [3,4,5,6,7,9]
和查询
0 3
3 5
1 2
2 4
Output
Index 0 has been queried 1 time.
Index 1 has been queried 2 times.
Index 2 has been queried 3 times.
Index 3 has been queried 3 times.
Index 4 has been queried 2 times.
Index 5 has been queried 1 time.
Run Code Online (Sandbox Code Playgroud)
我该如何尽快做到这一点?