标签:
Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
有一种KMP算法,不过实现起来比较复杂,这里直接用暴力解法
public class Solution { public int strStr(String haystack, String needle) { int h=haystack.length(); int n=needle.length(); for(int i=0; i<=h-n; i++){ int j; for(j=0; j<n; j++){ if(needle.charAt(j) != haystack.charAt(i+j)){ break; } } if(j == n){ return i; } } return -1; } }
标签:
原文地址:http://www.cnblogs.com/incrediblechangshuo/p/5453670.html