Which of the basic data structures is the most suitable if you need to access its elements by their positions in O(1) time (this is called random access)?
选项:
A:Queue;
B:Stack;
C:Array;
D:List
发布时间:2024-05-14 19:45:31