Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 36 additions & 0 deletions a.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
from collections import defaultdict, deque

def solution(tickets):
dic = defaultdict(list)
for start,end in tickets:
dic[start].append(end)
dic2 = {}
for key, value in dic.items():
dic2[key] = sorted(value)

visited = {}
for key in dic2.keys():
visited[key] = []

n = sum([len(i) for i in dic2.values()])
ans = None
def dfs(lst):
nonlocal ans
if len(lst) == n + 1:
ans = lst
return

last = lst[-1]
if last in dic2:
for key, value in dic2.items():
if not value in visited[key]:
visited[key].append(value)
dfs(lst + [value])

visited[key].remove(last)

return

dfs(['ICN'])


Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
class Solution:
def countSubstrings(self, s: str, t: str) -> int:
n = len(s)
m = len(t)

def is_diff_one(str1,str2):
o = len(str1)
same_num = 0
for i in range(o):
if str1[i] == str2[i]:
same_num +=1

return same_num + 1 == o

ans = 0
for i in range(n):
for j in range(i,n):
s_part = s[i:j+1]
for k in range(m-(j-i)):
t_part = t[k:k+(j-i+1)]
if is_diff_one(s_part,t_part):
ans +=1

return ans
Loading