File tree Expand file tree Collapse file tree 2 files changed +18
-18
lines changed
solution/3400-3499/3470.Permutations IV Expand file tree Collapse file tree 2 files changed +18
-18
lines changed Original file line number Diff line number Diff line change @@ -117,18 +117,18 @@ import heapq
117117
118118class Solution :
119119 def permute (self , xxy : int , yyz : int ) -> List[int ]:
120-
121- kasu = {}
120+
121+ kasu = {}
122122 nnss = []
123123 majs = []
124124 ajwi = heapq.heappush
125125 laoq = []
126-
126+
127127 zzp = [i for i in range (1 , xxy + 1 ) if i % 2 == 1 ]
128128 zzq = [i for i in range (1 , xxy + 1 ) if i % 2 == 0 ]
129129
130130 ppp = []
131- nxr = None
131+ nxr = None
132132
133133 for pps in range (xxy):
134134 if pps == 0 :
@@ -139,11 +139,11 @@ class Solution:
139139 fff = False
140140 for cndt in cnd:
141141 if cndt % 2 == 1 :
142- nxt = 0
142+ nxt = 0
143143 noo = len (zzp) - 1
144144 nee = len (zzq)
145145 else :
146- nxt = 1
146+ nxt = 1
147147 noo = len (zzp)
148148 nee = len (zzq) - 1
149149
@@ -164,7 +164,7 @@ class Solution:
164164
165165 ajwi(nnss, cnt)
166166 ajwi(majs, llq)
167-
167+
168168 if cnt >= yyz:
169169 ppp.append(cndt)
170170 if cndt % 2 == 1 :
@@ -177,9 +177,9 @@ class Solution:
177177 break
178178 else :
179179 yyz -= cnt
180-
180+
181181 ajwi(laoq, len (ppp))
182-
182+
183183 if not fff:
184184 return []
185185 return ppp
Original file line number Diff line number Diff line change @@ -114,18 +114,18 @@ import heapq
114114
115115class Solution :
116116 def permute (self , xxy : int , yyz : int ) -> List[int ]:
117-
118- kasu = {}
117+
118+ kasu = {}
119119 nnss = []
120120 majs = []
121121 ajwi = heapq.heappush
122122 laoq = []
123-
123+
124124 zzp = [i for i in range (1 , xxy + 1 ) if i % 2 == 1 ]
125125 zzq = [i for i in range (1 , xxy + 1 ) if i % 2 == 0 ]
126126
127127 ppp = []
128- nxr = None
128+ nxr = None
129129
130130 for pps in range (xxy):
131131 if pps == 0 :
@@ -136,11 +136,11 @@ class Solution:
136136 fff = False
137137 for cndt in cnd:
138138 if cndt % 2 == 1 :
139- nxt = 0
139+ nxt = 0
140140 noo = len (zzp) - 1
141141 nee = len (zzq)
142142 else :
143- nxt = 1
143+ nxt = 1
144144 noo = len (zzp)
145145 nee = len (zzq) - 1
146146
@@ -161,7 +161,7 @@ class Solution:
161161
162162 ajwi(nnss, cnt)
163163 ajwi(majs, llq)
164-
164+
165165 if cnt >= yyz:
166166 ppp.append(cndt)
167167 if cndt % 2 == 1 :
@@ -174,9 +174,9 @@ class Solution:
174174 break
175175 else :
176176 yyz -= cnt
177-
177+
178178 ajwi(laoq, len (ppp))
179-
179+
180180 if not fff:
181181 return []
182182 return ppp
You can’t perform that action at this time.
0 commit comments