Java学习笔记（day12）

 

---

一、顺序表（二）

在昨天学习的基础上，加入不同功能。搬运自搬运

12.1 查找给定元素所处的位置. 找不到就返回 -1.

12.2 在给定位置增加元素. 如果线性表已满, 或位置不在已有位置范围之内, 就拒绝增加. 该位置可以是在最后一个元素之后一个.

12.3 删除定定位置的元素. 要处理给定位置不合法的情况. 该位置必须是已经有数据的.

12.4 函数 要求同样的输入参数获得同样的输出结果, 但 方法 所依赖的数据既包括参数列表中给出的，也依赖于对象的成员变量. 因此, 面向对象所涉及的参数列表要短些. 例如, locate 方法就有效利用了 length 和 data 这两个成员变量.

二、代码编写

package datastructure;

/**
 * Sequential list.
 * 
 * @author Wei ze 1025976860@qq.com;
 */
public class SequentialList {

	/**
	 * The maximal length of the list. It is a constant.
	 */
	public static final int MAX_LENGTH = 10;

	/**
	 * The actual length not exceeding MAX_LENGTH. Attention: length is not only
	 * the member variable of Sequential list, but also the member variable of
	 * Array. In fact, a name can be the member variable of different classes.
	 */
	int length;

	/**
	 * The data stored in an array.
	 */
	int[] data;

	/**
	 *********************
	 * Construct an empty sequential list.
	 *********************
	 */
	public SequentialList() {
		length = 0;
		data = new int[MAX_LENGTH];
	}// Of the first constructor

	/**
	 *********************
	 * Construct a sequential list using an array.
	 * 
	 * @param paraArray
	 *            The given array. Its length should not exceed MAX_LENGTH. For
	 *            simplicity now we do not check it.
	 *********************
	 */
	public SequentialList(int[] paraArray) {//SequentialList(int[] paraArray)和SequentialList不是一个函数吗？如何分别调用啊。
		data = new int[MAX_LENGTH];
		length = paraArray.length;

		// Copy data.
		for (int i = 0; i < paraArray.length; i++) {
			data[i] = paraArray[i];
		} // Of for i
	}// Of the second constructor

	/**
	 *********************
	 * Overrides the method claimed in Object, the superclass of any class.
	 *********************
	 */
	public String toString() {
		String resultString = "";

		if (length == 0) {
			return "empty";
		} // Of if

		for (int i = 0; i < length - 1; i++) {
			resultString += data[i] + ", ";
		} // Of for i

		resultString += data[length - 1];

		return resultString;
	}// Of toString

	/**
	 *********************
	 * Reset to empty.
	 *********************
	 */
	public void reset() {
		length = 0;
	}// Of reset

	 /**
	    *********************
	    * Locate the given value. If it appears in multiple positions, simply
	    * return the first one.
	    * 
	    * @param paraValue
	    *            The given value.
	    * @return The position. -1 for not found.
	    *********************
	    */
	   public int locate(int paraValue) {
	   	int tempPosition = -1;

	   	for (int i = 0; i < length; i++) {
	   		if (data[i] == paraValue) {
	   			tempPosition = i;
	   			break;
	   		} // Of if
	   	} // Of for i

	   	return tempPosition;
	   }// Of locate

	   /**
	    *********************
	    * Insert a value to a position. If the list is already full, do nothing.
	    * 
	    * @param paraPosition
	    *            The given position.
	    * @param paraValue
	    *            The given value.
	    * @return Success or not.
	    *********************
	    */
	   public boolean insert(int paraPosition, int paraValue) {
	   	if (length == MAX_LENGTH) {
	   		System.out.println("List full.");
	   		return false;
	   	}//Of if
	   	
	   	if ((paraPosition < 0) || (paraPosition > length)) {
	   		System.out.println("The position " + paraPosition + " is out of bounds.");
	   		return false;
	   	} // Of if

	   	// From tail to head.
	   	for (int i = length; i > paraPosition; i--) {
	   		data[i] = data[i - 1];
	   	} // Of for

	   	data[paraPosition] = paraValue;
	   	length++;

	   	return true;
	   }// Of insert

	   /**
	    *********************
	    * Delete a value at a position.
	    * 
	    * @param paraPosition
	    *            The given position.
	    * @return Success or not.
	    *********************
	    */
	   public boolean delete(int paraPosition) {
	   	if ((paraPosition < 0) || (paraPosition >= length)) {
	   		System.out.println("The position " + paraPosition + " is out of bounds.");
	   		return false;
	   	} // Of if

	   	// From head to tail.
	   	for (int i = paraPosition; i < length - 1; i++) {
	   		data[i] = data[i + 1];
	   	} // Of for

	   	length--;

	   	return true;
	   }// Of insert

	   /**
	    *********************
	    * The entrance of the program.
	    * 
	    * @param args
	    *            Not used now.
	    *********************
	    */
	   public static void main(String args[]) {
	   	int[] tempArray = { 1, 4, 6, 9 };
	   	SequentialList tempFirstList = new SequentialList(tempArray);
	   	System.out.println("Initialized, the list is: " + tempFirstList.toString());
	   	System.out.println("Again, the list is: " + tempFirstList);

	   	int tempValue = 4;
	   	int tempPosition = tempFirstList.locate(tempValue);
	   	System.out.println("The position of " + tempValue + " is " + tempPosition);

	   	tempValue = 5;
	   	tempPosition = tempFirstList.locate(tempValue);
	   	System.out.println("The position of " + tempValue + " is " + tempPosition);

	   	tempPosition = 2;
	   	tempValue = 5;
	   	tempFirstList.insert(tempPosition, tempValue);
	   	System.out.println("After inserting " + tempValue + " to position " + tempPosition
	   			+ ", the list is: " + tempFirstList);

	   	tempPosition = 8;
	   	tempValue = 10;
	   	tempFirstList.insert(tempPosition, tempValue);
	   	System.out.println("After inserting " + tempValue + " to position " + tempPosition
	   			+ ", the list is: " + tempFirstList);

	   	tempPosition = 3;
	   	tempFirstList.delete(tempPosition);
	   	System.out.println("After deleting data at position " + tempPosition + ", the list is: "
	   			+ tempFirstList);

	   	for(int i = 0; i < 8; i ++) {
	   		tempFirstList.insert(i, i);
	   		System.out.println("After inserting " + i + " to position " + i
	   				+ ", the list is: " + tempFirstList);
	   	}//Of for i
	   	
	   	tempFirstList.reset();
	   	System.out.println("After reset, the list is: " + tempFirstList);
	   }// Of main
}// Of class SequentialList

三、运行结果

---