classsqList{constructor(){this.Elem =[];// 存储数组this.length =0;// 当前长度}// 初始化顺序表initList_Sq(){this.Elem =[];this.length =0;}// 在顺序表的第i个位置插入新的元素elemlistInsert_Sq(index,elem){if(index <1|| index >this.length+1)returnERROR;// index值不合法for(var i =this.length -1; i >= index-1; i--){this.Elem[i+1]=this.Elem[i];}this.Elem[index-1]= elem;++this.length;returnOK;}// 删除顺序表的第i个位置的元素listDelete_Sq(index){if(index<1|| index >this.length)returnERROR;// index值不合法for(var i = index-1; i <this.length; i++){this.Elem[i]=this.Elem[i+1];}--this.length;this.Elem.length =this.length;returnOK;}// 在顺序表中查找elem第一次出现的位序,如果查找到,则返回该位序,否则返回0locateElem_Sq(elem){let i =1;while(i <=this.length &&this.Elem[i-1]!== elem){++i;}return i <=this.length ? i :0;}}