string 类的学习

final的class，不能被继承；
实现的接口： java.io.Serializable, Comparable<String>, CharSequence

属性：

 

/** The value is used for character storage. */

    private final char value[];//存储字符串

 

    /** The offset is the first index of the storage that is used. */

    private final int offset;//字符串第一个位置

 

    /** The count is the number of characters in the String. */

    private final int count;//字符串的数量

 

    /** Cache the hash code for the string */

    private int hash; // Default to 0

 

    /** use serialVersionUID from JDK 1.0.2 for interoperability */

    private static final long serialVersionUID = -6849794470754667710L;

 

 

构造方法如下：

 

public String()构造函数

  public String(){

  this.offset=0;

this.count=0;

this.value=new char[0];

}
public String(String original)构造函数
public String(char value[])构造函数
public String(char value[],int offset,count)
public String(int[] codePoints, int offset, int count)
public String(StringBuffer buffer)通过StringBuffer进行构造
public String(StringBuilder builder)通过StringBuilder进行构造

String(int offset,int count,char value[])包可见的构造函数，提高速度

 

• indexof(String s)方法调用的 代码如下：

static int indexOf(char[] source, int sourceOffset, int sourceCount, char[] target, int targetOffset, int targetCount, int fromIndex) { if (fromIndex >= sourceCount) { return (targetCount == 0 ? sourceCount : -1); } if (fromIndex < 0) { fromIndex = 0; } if (targetCount == 0) { return fromIndex; } char first = target[targetOffset]; int max = sourceOffset + (sourceCount - targetCount); for (int i = sourceOffset + fromIndex; i <= max; i++) { /* Look for first character. */ if (source[i] != first) { while (++i <= max && source[i] != first); } /* Found first character, now look at the rest of v2 */ if (i <= max) { int j = i + 1; int end = j + targetCount - 1; for (int k = targetOffset + 1; j < end && source[j] == target[k]; j++, k++); if (j == end) { /* Found whole string. */ return i - sourceOffset; } } } return -1; }

 

• repace()的方法代码如下：

 

public String replace(char oldChar, char newChar) { if (oldChar != newChar) { int len = count; int i = -1; char[] val = value; /* avoid getfield opcode */ int off = offset; /* avoid getfield opcode */ while (++i < len) { if (val[off + i] == oldChar) { break; } } if (i < len) { char buf[] = new char[len]; for (int j = 0 ; j < i ; j++) { buf[j] = val[off+j]; } while (i < len) { char c = val[off + i]; buf[i] = (c == oldChar) ? newChar : c; i++; } return new String(0, len, buf); } } return this; } 

上面代码实现的主要是：先找到位置，然后复制找到的位置到buf字符串中。然后遍历后面的字符串是否有要替代的字符。

优点是：当没有找到一个要替代的字符时候 不会创建buf缓存。

我自己写的代码如下：

char buf[] = new char[len]; while(++i<len){ buf[i]=(val[off+i]==oldChar)? newChar:val[off+i]; i++; } 

这样的话空间buf是一定创建了。

 

• subString

的代码如下： 直接重新构造一个从 beginIndex 到endIndex的string

(beginIndex == 0) && (endIndex == count) 如果是本身的话就返回this本身。

public String substring(int beginIndex, int endIndex) { if (beginIndex < 0) { throw new StringIndexOutOfBoundsException(beginIndex); } if (endIndex > count) { throw new StringIndexOutOfBoundsException(endIndex); } if (beginIndex > endIndex) { throw new StringIndexOutOfBoundsException(endIndex - beginIndex); } return ((beginIndex == 0) && (endIndex == count)) ? this : new String(offset + beginIndex, endIndex - beginIndex, value); } 

 

• trim()

代码如下：返回字符串的副本，忽略前导空白和尾部空白.用变量st和len来表示前或尾部有空白，当都没空白的时候

返回this本身，否则返回substring(st,len)从前面非空白处到后面非空白处。

代码优点：找出前或后面的空白位置，然后调用substring(st,len)截取从st到len的位置string。or return this.

public String trim() { int len = count; int st = 0; int off = offset; /* avoid getfield opcode */ char[] val = value; /* avoid getfield opcode */ while ((st < len) && (val[off + st] <= ' ')) { st++; } while ((st < len) && (val[off + len - 1] <= ' ')) { len--; } return ((st > 0) || (len < count)) ? substring(st, len) : this; } 

 

• lastIndexOf()

代码如下：主要是从后面往前查询子str.同时注意要匹配的len,和用到标注的形式从后往前移动。。

static int lastIndexOf(char[] source, int sourceOffset, int sourceCount, char[] target, int targetOffset, int targetCount, int fromIndex) { /* * Check arguments; return immediately where possible. For * consistency, don't check for null str. */ int rightIndex = sourceCount - targetCount; if (fromIndex < 0) { return -1; } if (fromIndex > rightIndex) { fromIndex = rightIndex; } /* Empty string always matches. */ if (targetCount == 0) { return fromIndex; } int strLastIndex = targetOffset + targetCount - 1; char strLastChar = target[strLastIndex]; int min = sourceOffset + targetCount - 1; int i = min + fromIndex; startSearchForLastChar: while (true) { while (i >= min && source[i] != strLastChar) { i--; } if (i < min) { return -1; } int j = i - 1; int start = j - (targetCount - 1); int k = strLastIndex - 1; while (j > start) { if (source[j--] != target[k--]) { i--; continue startSearchForLastChar; } } return start - sourceOffset + 1; } } 

自己写了一个思路和上面一样：调试用了点时间，主要是下标位置问题。代码如下

static int lastOtherIndexOf(char[] source, char[] target) { int TLen = target.length; int SLen = source.length; int i = SLen-1; int strLastIndex = TLen - 1; char strLastChar = target[strLastIndex]; int j; while (i >=strLastIndex) { if (source[i] == strLastChar) { int k=strLastIndex-1; j = i-1; while (k >=0) { if (source[j] != target[k]) { break; } j--; k--; } if (k +1== 0) { return j+1; } } i--; } return -1; }