Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k 0 && n-i-1>=count-j && res[j-1]arr2...
转载
2016-01-02 10:17:00
74阅读
2评论
My Solution: Highest votes in discussion
转载
2016-12-03 06:22:00
73阅读
2评论
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, r
原创
2022-08-03 16:51:38
19阅读
http://www.elijahqi.win/archives/3720 Description 神犇Aleph在陪蒟蒻Bob玩一个游戏。神犇Aleph随手在
原创
2022-08-08 13:11:40
11阅读
/*Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2,
原创
2021-07-09 14:05:15
78阅读
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexi
转载
2020-05-21 08:36:00
44阅读
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexi
转载
2017-10-27 14:03:00
67阅读
2评论
414. Third Maximum Number*
https://leetcode.com/problems/third-maximum
原创
2022-05-30 11:09:01
99阅读
Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length
原创
2022-08-03 21:01:34
59阅读
https://leetcode.com/problems/create-maximum-number/ 这道题目太难了，花了我很多时间。最后还是参考了别人的方法。还少加了个greater方法。很难。
转载
2016-11-06 23:32:00
82阅读
2评论
题目：
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).
Example 1:
Inpu
原创
2023-03-07 12:36:15
95阅读
在myeclipse安装svn插件时svn的接口显示javaHL(JNI Not Avaliable).所以选择的第二个接口.SVNKit(Pure Java) SVNKit v1.3.0.5847 可
原创
2022-08-05 10:54:52
131阅读
Given a positive integer num consisting only of digits 6 and 9. Return the maximum number you can get by changing at most one digit (6 becomes 9, and
转载
2020-01-22 03:27:00
179阅读
2评论
/*Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2,
原创
2022-02-03 14:24:52
59阅读
1189. Maximum Number of Balloons*\https://leetcode.com/problems/maximum-number-of-balloons/题目描述Given a stri
原创
2022-05-30 10:43:15
98阅读
1323. Maximum 69 Number*https://leetcode.com/problems/maximum-69-number/题目描述Given a positive in
原创
2022-05-30 12:44:24
68阅读
Given a positive integernumconsisting only of digits 6 and 9.Return the maximum number you can get by changingat mostone digit (6 becomes 9, and 9 becomes 6).Example 1:Input: num = 9669...
原创
2022-08-10 15:10:55
13阅读
网络流/最大流/二分or贪心 题目大意：有n个队伍，两两之间有一场比赛，胜者得分+1，负者得分+0，问最多有几只队伍打败了所有得分比他高的队伍？ 可以想到如果存在这样的“strong king”那么一定是胜场较多的队伍……（比他赢得多的队伍num少，而他总共赢得场数times足够多，至少得满足t...
原创
2021-08-04 14:54:04
63阅读
