2022-07-28

[Zheaoli]

2022-07-28

[gongpeione]

/*
 * @lc app=leetcode id=28 lang=javascript
 *
 * [28] Implement strStr()
 */

// @lc code=start
/**
 * @param {string} haystack
 * @param {string} needle
 * @return {number}
 */
var strStr = function(haystack, needle) {
    let needlePointer = 0;

    if (needle === '') {
        return 0;
    }

    for (let i = 0; i < haystack.length; i++) {
        if (haystack[i] !== needle[needlePointer]) {
            i -= needlePointer;
            needlePointer = 0;
            continue;
        }
        if (needlePointer === needle.length - 1) {
            return i - needlePointer;
        }
        needlePointer++;
    }

    return -1;
};
// @lc code=end

---

微信id: 弘树 来自 vscode 插件

[SaraadKun]

1331. 数组序号转换

class Solution {
    public int[] arrayRankTransform(int[] arr) {
        int n = arr.length;
        int[] clone = arr.clone();
        Arrays.sort(clone);
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : clone) {
            if (!map.containsKey(num)) {
                map.put(num, map.size() + 1);
            }
        }
        int[] ans = new int[n];
        for (int i = 0; i < n; i++) {
            ans[i] = map.get(arr[i]);
        }
        return ans;
    }
}

---

WeChat: Saraad