class Solution:
def maxValue(self, n: str, x: int) -> str:
ans = ""
flag = 0
if n[0] == "-":
for i in range( 1, len(n),1):
if flag == 1:
ans += n[i]
continue
if int(n[i]) > x:
ans += str(x)
ans += n[i]
flag = 1
else:
ans += n[i]
if flag == 0:
ans += str(x)
return "-" + ans
else:
for i in range(len(n)):
if flag == 1:
ans += n[i]
continue
if int(n[i]) < x:
ans += str(x)
ans += n[i]
flag = 1
else:
ans += n[i]
if flag == 0:
ans += str(x)
return ans437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |