From 45e8b65ba0ed52a7a34f2704606ed3d8e53f155c Mon Sep 17 00:00:00 2001 From: jihyup-byun Date: Sat, 31 Oct 2026 06:27:27 +0000 Subject: [PATCH] 3719 --- .../v3/3719. Longest Balanced Subarray I.py" | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 "leetcode3/\353\263\200\354\247\200\355\230\221/v3/3719. Longest Balanced Subarray I.py" diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v3/3719. Longest Balanced Subarray I.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/3719. Longest Balanced Subarray I.py" new file mode 100644 index 00000000..674472be --- /dev/null +++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/3719. Longest Balanced Subarray I.py" @@ -0,0 +1,34 @@ +''' +실패 +''' +class Solution: + def longestBalanced(self, nums: List[int]) -> int: + st = set() + lst = [] + for num in nums: + if num in st: + lst.append(0) + else: + if num % 2 == 0: + lst.append(1) + else: + lst.append(-1) + + st.add(num) + + ans = [] + tmp2 = [] + + for i in lst: + tmp = [] + for value, length in ans: + tmp.append((value + i, length + 1)) + + tmp.append((i, 1)) + ans = tmp + tmp2.extend(ans) + + try: + return max([length for value, length in tmp2 if value == 0 and not (value == 0 and length == 1)]) + except: + return 0