Share my java solution


  • -1
    K
    public class Solution {
        public int strStr(String haystack, String needle) {
            if (haystack.length() == 0 && needle.length() == 0) {
                return 0;
            }
            if (needle.length() == 0) {
                return 0;
            }
            for (int i = 0; i <= haystack.length() - needle.length(); i++) {
                for (int j = 0; j < needle.length(); j++) {
                    if (haystack.charAt(i + j) != needle.charAt(j)) {
                        break;
                    }
                    if (j == needle.length() - 1) {
                        return i;
                    }
                }
            }
            return - 1;
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.