zerovoids.dev
LEETCODEEasy

Find the Index of the First Occurrence in a String

풀이일 2025 · 03 · 27기록 0 ms · 56.1 MB원문 leetcode ↗
Two PointersStringString MatchingZ AlgorithmKnuth–Morris–Pratt AlgorithmBoyer–Moore String-Search Algorithm
문제

Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

 

Example 1:

Input: haystack = "sadbutsad", needle = "sad"
Output: 0
Explanation: "sad" occurs at index 0 and 6.
The first occurrence is at index 0, so we return 0.

Example 2:

Input: haystack = "leetcode", needle = "leeto"
Output: -1
Explanation: "leeto" did not occur in "leetcode", so we return -1.

 

Constraints:

  • 1 <= haystack.length, needle.length <= 104
  • haystack and needle consist of only lowercase English characters.
풀이 TypeScript
function strStr(haystack: string, needle: string): number {
  return haystack.indexOf(needle)
}
복사됨