当前位置:网站首页>Leetcode:20220213 week race (less bugs, top 10% 555)
Leetcode:20220213 week race (less bugs, top 10% 555)
2022-07-06 00:19:00 【White speed Dragon King's review】
Ideas :
1. Divide the odd and even statistical data frequency
2. Then see if they are equal
3. Take down one as appropriate
src:
lass Solution:
def minimumOperations(self, nums: List[int]) -> int:
num1 = nums[::2]
num2 = nums[1::2]
n1 = len(num1)
n2 = len(num2)
if n1 * n2 == 0:
return 0
cnt1 = defaultdict(int)
for num in num1:
cnt1[num] += 1
cnt2 = defaultdict(int)
for num in num2:
cnt2[num] += 1
sort1 = sorted(cnt1.items(),key=lambda x:x[1],reverse=True) # Sort in descending order according to word frequency
sort2 = sorted(cnt2.items(),key=lambda x:x[1],reverse=True) # Sort in descending order according to word frequency
has = 0
if sort1[0][0] != sort2[0][0]:
has = sort1[0][1] + sort2[0][1]
else:
if len(sort1) == 1 and len(sort2) == 1:
has = max(sort1[0][1], sort2[0][1])
elif len(sort1) == 1:
has = sort1[0][1] + sort2[1][1]
elif len(sort2) == 1:
has = sort2[0][1] + sort1[1][1]
else:
if sort1[1][1] + sort2[0][1] > sort1[0][1] + sort2[1][1]:
has = sort1[1][1] + sort2[0][1]
else:
has = sort1[0][1] + sort2[1][1]
return n1 + n2 - has
Ideas :
Solve the absolute value equation , Given x
If greater than or equal to x, Make a difference ; If less than x, Then take the sum of this number 0 Distance of
By traversing x, You can get the smallest ans
Be careful , You don't need to calculate every traversal , It only needs - some + Just some , This is the charm of the mixture of absolute value function and traversal
src:
class Solution:
def minimumRemoval(self, beans: List[int]) -> int:
# All become the smallest or Minimal change 0
beans.sort()
n = len(beans)
#print(beans)
# Determine a value x, Less than it, add it all , If it is greater than it, take the difference
temp = 0
x = beans[0]
index = 0
ans = 0xffffffff
for num in beans:
temp += num - x
ans = min(ans, temp)
while index < n:
nextIndex = index
while nextIndex < n and beans[nextIndex] == x:
nextIndex += 1
if nextIndex >= n:
break
temp += x * (nextIndex - index)
y = beans[nextIndex]
temp -= (y - x) * (n - nextIndex)
ans = min(ans, temp)
x = y
index = nextIndex
return ans
summary :
without bug, Just before 300 了 , It's all because the second question is wrong index
边栏推荐
- MDK debug时设置数据实时更新
- OS i/o devices and device controllers
- QT--线程
- Yolov5、Pycharm、Anaconda环境安装
- Senparc. Weixin. Sample. MP source code analysis
- Wechat applet -- wxml template syntax (with notes)
- Priority queue (heap)
- [noi simulation] Anaid's tree (Mobius inversion, exponential generating function, Ehrlich sieve, virtual tree)
- FPGA内部硬件结构与代码的关系
- 7.5 simulation summary
猜你喜欢
OS i/o devices and device controllers
Key structure of ffmpeg - avformatcontext
Learn PWN from CTF wiki - ret2libc1
Doppler effect (Doppler shift)
Tools to improve work efficiency: the idea of SQL batch generation tools
MDK debug时设置数据实时更新
Detailed explanation of APP functions of door-to-door appointment service
Hudi of data Lake (2): Hudi compilation
Single merchant v4.4 has the same original intention and strength!
FFT 学习笔记(自认为详细)
随机推荐
Room cannot create an SQLite connection to verify the queries
FPGA内部硬件结构与代码的关系
18. (ArcGIS API for JS) ArcGIS API for JS point collection (sketchviewmodel)
Doppler effect (Doppler shift)
Knowledge about the memory size occupied by the structure
《编程之美》读书笔记
数据库遇到的问题
什么叫做信息安全?包含哪些内容?与网络安全有什么区别?
Learn PWN from CTF wiki - ret2libc1
上门预约服务类的App功能详解
Mysql - CRUD
Extracting profile data from profile measurement
Global and Chinese market of water heater expansion tank 2022-2028: Research Report on technology, participants, trends, market size and share
时区的区别及go语言的time库
Global and Chinese market of digital serial inverter 2022-2028: Research Report on technology, participants, trends, market size and share
What are the functions of Yunna fixed assets management system?
[QT] QT uses qjson to generate JSON files and save them
MySQL global lock and table lock
DEJA_VU3D - Cesium功能集 之 055-国内外各厂商地图服务地址汇总说明
[Luogu cf487e] tours (square tree) (tree chain dissection) (line segment tree)