基于数组的顺序表实现

基于数组的顺序表实现

1.接口

package com.DS.ArrayList;

/**
 * @Name:线性表接口
 * @Author:ZYJ
 * @Date:2019-07-23-10:26
 * @Description:
 */
public interface Sequence {
    void add(Object data);
    Object remove(int index);
    Object set(int index,Object newData);
    Object get(int index);
    boolean contains(Object data);
    int size();    Object[] toArray();
    void clear();
}

2.实现类

package com.DS.ArrayList;

import java.util.Arrays;

/**
 * @Name: 实现基于数组的线性标
 * @Author:ZYJ
 * @Date:2019-07-23-11:56
 * @Description:
 */
public class ArrayListImpl implements Sequence {
    private Object[] elementDates;
    private static final int DEFAULT_CAPACITY=10;
    public int size;
    private static final int MAX_ARRAY_SIZE=Integer.MAX_VALUE-8;

    public ArrayListImpl(int capaCity) {
        this.elementDates=new Object[capaCity];
    }

    public ArrayListImpl() {
        this.elementDates =new Object[DEFAULT_CAPACITY];
    }


    @Override
    public void add(Object data) {
       ensureCapacity(size+1);
       elementDates[size++]=data;

    }
    public void add(int index,Object date){
        ensureCapacity(size+1);
        for(int j=size;j<index;j--){
            elementDates[j]=elementDates[j-1];
        }
        elementDates[index]=date;
        size++;
    }

    @Override
    public Object remove(int index) {
        rangCheck(index);
        Object oldDate = elementDates[index];
        int moveSize = size-index-1;
        if(moveSize>0) {
            System.arraycopy(elementDates, index + 1, elementDates, index, moveSize);
        }
        elementDates[--size]=null;
        return oldDate;
    }

    @Override
    public Object set(int index, Object newData) {
        rangCheck(index);
        Object oldDate = elementDates[index];
        elementDates[index]=newData;
        return oldDate;
    }

    @Override
    public Object get(int index) {
        rangCheck(index);
        return elementDates[index];
    }

    @Override
    public boolean contains(Object data) {
        if(data==null){
            for(int i=0;i<size;i++){
                if(elementDates[i]==null){
                    return true;
                }
            }
        }else {
            for(int i=0;i<size;i++){
                if(elementDates[i].equals(data)){
                    return true;
                }
            }
        }
        return false;
    }

    @Override
    public int size() {
        return this.size;
    }

    @Override
    public Object[] toArray() {
        return Arrays.copyOf(elementDates,size);
    }

    @Override
    public void clear() {
        for(int i=0;i<elementDates.length;i++){
            elementDates[i]=null;
        }
        this.size=0;

    }
    public void ensureCapacity(int minCap){
        if(minCap-elementDates.length>0) {
            grow(minCap);
        }
    }

    private void grow(int minCap) {
        int oldCap=elementDates.length;
        int newCap=oldCap<<1;
        if(newCap-minCap<0){
            newCap=minCap;
        }
        if(minCap-MAX_ARRAY_SIZE>0){
            throw new ArrayIndexOutOfBoundsException("超过最大阈值");
        }
        elementDates= Arrays.copyOf(elementDates,newCap);
    }
    private void rangCheck(int index){
        if(index>=size){
            throw new IndexOutOfBoundsException("下标不存在");
        }
    }
}

3.测试类

package com.DS.ArrayList;

/**
 * @Name:
 * @Author:ZYJ
 * @Date:2019-07-23-11:46
 * @Description:
 */
public class TestDemo {
    public static void main(String[] args) {
         Sequence sequence = new ArrayListImpl(5);
         sequence.add(1);
         sequence.add(2);
         sequence.add(3);
         sequence.add(4);
         sequence.add(5);
        System.out.println(sequence.size());
         ((ArrayListImpl) sequence).add(3,8);
        System.out.println(sequence.size());
       // System.out.println(sequence.contains(4));
       // System.out.println(sequence.get(3));
        //System.out.println(sequence.remove(1));
        //System.out.println(((ArrayListImpl) sequence).size);
       /* ((ArrayListImpl) sequence).add(3,6);//123445
       Object[] result = sequence.toArray();
       for(int i=0;i<result.length;i++){
           System.out.print(result[i]);
       }

        System.out.println(sequence.get(5));
        System.out.println(sequence.size());*/
        //System.out.println(sequence.get(6));
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值