The Wayback Machine - https://web.archive.org/web/20201126013301/https://github.com/TheAlgorithms/Python/pull/3809
Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added code for Regular Expression Matching #3809

Open
wants to merge 1 commit into
base: master
from

Conversation

@Vinaysukhwal
Copy link

@Vinaysukhwal Vinaysukhwal commented Oct 28, 2020

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Python files are placed inside an existing directory.
  • All filenames are in all lowercase characters with no spaces or dashes.
  • All functions and variable names follow Python naming conventions.
  • All function parameters and return values are annotated with Python type hints.
  • All functions have doctests that pass the automated testing.
  • All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
  • If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.
@Vinaysukhwal Vinaysukhwal requested a review from Kush1101 as a code owner Oct 28, 2020
https://leetcode.com/problems/regular-expression-matching/
"""
def isMatch(self, s: str, p: str) -> bool:

This comment has been minimized.

@mrmaxguns

mrmaxguns Nov 5, 2020
Contributor

Python naming conventions state that function names should be in snake case and one letter variable names are not acceptable. Also, there is no need for a self argument as the function isn't a class method:

def is_match(check_string: str, pattern: str) -> bool:
    ...

https://leetcode.com/problems/regular-expression-matching/
"""
def isMatch(self, s: str, p: str) -> bool:
dp = [[0 for i in range(len(p)+1)] for j in range(len(s)+1)]

This comment has been minimized.

@mrmaxguns

mrmaxguns Nov 5, 2020
Contributor

What is dp? Variable names should be short, but descriptive.


for i in range(1,len(s)+1):
for j in range(1,len(p)+1):
if(p[j-1]==s[i-1] or p[j-1]=="."):

This comment has been minimized.

@mrmaxguns

mrmaxguns Nov 5, 2020
Contributor

The parentheses are unnecessary and redundant:

if p[j - 1] == s[i - 1] or p[j - 1] == ".":
    ...

if(p[j-1]==s[i-1] or p[j-1]=="."):
dp[i][j] = dp[i-1][j-1]

elif(j>1 and p[j-1]=="*"):

This comment has been minimized.

@mrmaxguns

mrmaxguns Nov 5, 2020
Contributor

These parentheses can be removed.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Linked issues

Successfully merging this pull request may close these issues.

None yet

2 participants
You can’t perform that action at this time.