Add comprehensive LeetCode solutions index documentation
This commit is contained in:
54
src/exercises/392.is-subsequence.py
Normal file
54
src/exercises/392.is-subsequence.py
Normal file
@@ -0,0 +1,54 @@
|
||||
# @leet imports start
|
||||
from string import *
|
||||
from re import *
|
||||
from datetime import *
|
||||
from collections import *
|
||||
from heapq import *
|
||||
from bisect import *
|
||||
from copy import *
|
||||
from math import *
|
||||
from random import *
|
||||
from statistics import *
|
||||
from itertools import *
|
||||
from functools import *
|
||||
from operator import *
|
||||
from io import *
|
||||
from sys import *
|
||||
from json import *
|
||||
from builtins import *
|
||||
import string
|
||||
import re
|
||||
import datetime
|
||||
import collections
|
||||
import heapq
|
||||
import bisect
|
||||
import copy
|
||||
import math
|
||||
import random
|
||||
import statistics
|
||||
import itertools
|
||||
import functools
|
||||
import operator
|
||||
import io
|
||||
import sys
|
||||
import json
|
||||
from typing import *
|
||||
|
||||
# @leet imports end
|
||||
|
||||
|
||||
# @leet start
|
||||
class Solution:
|
||||
def isSubsequence(self, s: str, t: str) -> bool:
|
||||
i, j = 0, 0
|
||||
while j < len(s):
|
||||
if i >= len(t):
|
||||
break
|
||||
if t[i] == s[j]:
|
||||
j += 1
|
||||
i += 1
|
||||
|
||||
return j == len(s)
|
||||
|
||||
|
||||
# @leet end
|
||||
Reference in New Issue
Block a user