From cd42299e731adf1dc977a481f1d4291e4524f474 Mon Sep 17 00:00:00 2001 From: Mhrooz Date: Tue, 28 May 2024 16:33:16 +0200 Subject: [PATCH] amazon oa --- 392-240527-pass/main.py | 18 ++++++++++++++++++ 9-240525-pass/main.py | 15 +++++++++++++++ sample.py | 19 +++++++++++++++++++ 3 files changed, 52 insertions(+) create mode 100644 392-240527-pass/main.py create mode 100644 9-240525-pass/main.py create mode 100644 sample.py diff --git a/392-240527-pass/main.py b/392-240527-pass/main.py new file mode 100644 index 0000000..40fd1c5 --- /dev/null +++ b/392-240527-pass/main.py @@ -0,0 +1,18 @@ +class Solution: + def isSubsequence(self, s: str, t: str) -> bool: + cnt = 0 + idt_m = 0 + for idx, chs in enumerate(s): + for idt, cht in enumerate(t[idt_m:]): + if cht == chs: + idt_m = idt + idt_m + 1 + cnt += 1 + print(idt_m, idt, cht) + break + if cnt == len(s): return True + return False + +sol = Solution() +s = "axc" +t = "ahbgdc" +print(sol.isSubsequence(s,t)) \ No newline at end of file diff --git a/9-240525-pass/main.py b/9-240525-pass/main.py new file mode 100644 index 0000000..7a3c0d0 --- /dev/null +++ b/9-240525-pass/main.py @@ -0,0 +1,15 @@ +class Solution: + def isPalindrome(self, x: int) -> bool: + s = str(x) + if len(s) % 2 == 0: + mid = len(s) // 2 - 1 + for i in range(mid): + if s[i] != s[len(s) - i - 1]: + return False + return True + else: + mid = len(s) // 2 + for i in range(mid): + if s[i] != s[len(s) - i - 1]: + return False + return True \ No newline at end of file diff --git a/sample.py b/sample.py new file mode 100644 index 0000000..02daded --- /dev/null +++ b/sample.py @@ -0,0 +1,19 @@ +def makePowerNonDecreasing(power): + # Write your code here + res=0 + gap=0 + while len(power)>1: + power[1]+=res + print(power, res) + if power[1]>=power[0]: + power.pop(0) + else: + gap=power[0]-power[1] + res+=gap + power.pop(0) + power[0]+=gap + print(power, res) + return res + +res = makePowerNonDecreasing([3,5,2,6,3]) +print(res) \ No newline at end of file