filmov
tv
Maximum Swap - Leetcode 670 - Java
Показать описание
Problem Description
You are given an integer num. You can swap two digits at most once to get the maximum valued number.
Return the maximum valued number you can get.
You are given an integer num. You can swap two digits at most once to get the maximum valued number.
Return the maximum valued number you can get.
0:15:40
0:19:05
0:15:12
0:11:43
0:19:36
0:14:34
0:17:24
0:26:14
0:20:52
0:05:54
0:07:19
0:12:12
0:08:14
0:16:36
0:09:25
0:17:32
0:12:38
0:18:55
0:11:03
0:06:43
0:07:50
0:16:24
0:15:53
0:31:18