【leetcode 26 27 28】Remove Duplicates from Sorted Array & Remove Element & Implement strStr()

最新推荐文章于 2021-07-19 11:09:23 发布

原创最新推荐文章于 2021-07-19 11:09:23 发布 · 121 阅读

0 ·

CC 4.0 BY-SA版权

小白leetcode刷题笔记专栏收录该内容

33 篇文章

订阅专栏

本文提供了三道LeetCode经典题目“删除排序数组中的重复项”、“移除元素”及“实现strStr()”的Python解决方案。通过简洁有效的代码示例，帮助读者理解这些常见算法问题的解决思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题链接：
https://leetcode.com/problems/remove-duplicates-from-sorted-array/
https://leetcode.com/problems/remove-element
https://leetcode.com/problems/implement-strstr
这几个比较容易，就直接记录一下代码了。
Remove Duplicates from Sorted Array

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        
        i = 0
        count = 0
        while i < len(nums)-1:
            while nums[i] == nums[i+1]:
                del nums[i + 1]
                if i == len(nums)-1:
                    break
            i += 1
        return len(nums)

Remove Element

class Solution(object):
    def removeElement(self, nums, val):
        """
        :type nums: List[int]
        :type val: int
        :rtype: int
        """
        while val in nums:
            nums.remove(val)
        return len(nums)

Implement strStr()

class Solution(object):
    def strStr(self, haystack, needle):
        """
        :type haystack: str
        :type needle: str
        :rtype: int
        """

        if not needle or haystack==needle:
            return 0
        i = 0

        while i <= len(haystack) - len(needle):
            if haystack[i] == needle[0]:
                if haystack[i:i + len(needle)] == needle:
                    return i
            i += 1
        return -1