day19--字符串匹配

代码:

package com.one;

public class MyString {

    public static final int MAX_LENGTH = 10;//the maximal length.

    int length;

    char[] data;

    public MyString() {
        length = 0;
        data = new char[MAX_LENGTH];
    }// of the first constructor

    public MyString(String paraString) {
        data = new char[MAX_LENGTH];
        length = paraString.length();

        for (int i = 0; i < length; i++) {
            data[i] = paraString.charAt(i);
        }// of for i
    }// of the second constructor.

    public String toString() {
        String resultString = "";

        for (int i = 0; i <length; i++) {
            resultString += data[i];
        }// of for i

        return resultString;
    }// of toString

    /**
     * Locate the position of a substring
     * @param paraMyString
     * @return The first position. -1 for no matching
     */
    public int locate(MyString paraMyString) {
        boolean tempMatch = false;
        for (int i = 0; i < length - paraMyString.length + 1; i++) {
            //Initialize
            tempMatch = true;
            for (int j = 0; j < paraMyString.length; j++) {
                if (data[i + j] != paraMyString.data[j]) {
                    tempMatch = false;
                    break;
                }// of if

            }// of for j

            if (tempMatch) {
                return i;
            }// of if
        }// of for i
        return -1;
    }// of locate

    public MyString substring(int paraStartPosition, int paraLength) {
        if (paraStartPosition + paraLength > length) {
            System.out.println("The bound is exceeded");
            return null;
        }// of if

        MyString resultMyString = new MyString();
        resultMyString.length = paraLength;
        for (int i = 0; i < paraLength; i++) {
            resultMyString.data[i] = data[paraStartPosition + i];
        }// of for i
        return resultMyString;
    }// of substring

    public static void main(String[] args) {
        MyString tempFirstString = new MyString("I like ik.");
        MyString tempSecondString = new MyString("ik");
        int tempPosition = tempFirstString.locate(tempSecondString);
        System.out.println("The position of \"" + tempSecondString + "\" in \"" + tempFirstString
                + "\" is: " + tempPosition);
        
        MyString tempThirdString = new MyString("ki");
        tempPosition = tempFirstString.locate(tempThirdString);
        System.out.println("The position of \"" + tempThirdString + "\" in \"" + tempFirstString
                + "\" is: " + tempPosition);
        
        tempThirdString = tempFirstString.substring(1,2);
        System.out.println("The substring is: \"" + tempThirdString + "\"");

        tempThirdString = tempFirstString.substring(5,5);
        System.out.println("The substring is: \"" + tempThirdString + "\"");
        
        tempThirdString = tempFirstString.substring(5,6);
        System.out.println("The substring is: \"" + tempThirdString + "\"");

    }// of main

}// of class MyString

运行结果:

The position of "ik" in "I like ik." is: 3
The position of "ki" in "I like ik." is: -1
The substring is: " l"
The substring is: "e ik."
The bound is exceeded.
The substring is: "null"
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值