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-09-11 21:42:38
A、Queue;
B、Stack;
C、Array;
D、List