数据结构算法myString.docVIP

myString的实现 public class MyString{ private final char[] value; //字符数组 private final int count; //统计存储的字符个数 字符数组拷贝private static void arrayCopy(char[] src, int srcPos, char[] dst,int dstPos, int length) throws IndexOutOfBoundsException { //src为源串的字符数组，srcPos为源串的起始下标 //dst为目标串的字符数组，Pos为目标串的起始下标 //length为拷贝的新串的长度 if( src.length-srcPos length || dst.length-dstPos length ) throw new IndexOutOfBoundsException(length); for(int i = 0; i length; i++){ dst[dstPos++] = src[srcPos++]; } } /** 构造函数 public MyString(){ value=new char[0]; count=0; } /** 构造函数 public MyString(char[] value, int offset, int count) throws IndexOutOfBoundsException { //使用value数组中从offset下标始、个数为count的字符串创建对象 if (offset 0) { throw new IndexOutOfBoundsException(offset); } if (count 0) { throw new IndexOutOfBoundsException(count); } if (offset value.length - count) { throw new IndexOutOfBoundsException(offset + count); } this.value = new char[count]; this.count = count; arrayCopy(value, offset, this.value, 0, count); //数组元素拷贝 } /构造函数 public MyString(char[] value){ this.count = value.length; this.value = new char[count]; arrayCopy(value, 0, this.value, 0, count); //数组元素拷贝 } /** 构造函数 public MyString(String str){ char[] array=str.toCharArray(); value = array; count = array.length; } /** 从字符串根据下标去字符函数 */ public char charAt(int index) throws StringIndexOutOfBoundsException { if ((index 0) || (index = count)) { throw new StringIndexOutOfBoundsException(index); } return value[index]; } /** 字符串比较函数 */ public int compareTo(MyString anotherString) { //若当前对象的串值大于anotherString的串值函数返回一个正整数 //若当前对象的串值等于anotherString的串值函数返回0 //若当前对象的串值小于anotherString的串值函数返回一个负整数 int len1 = count; int len2 = anotherString.count;