当前位置:网站首页>Yyds dry goods inventory leetcode question set 751 - 760
Yyds dry goods inventory leetcode question set 751 - 760
2022-07-06 19:25:00 【Brother daze who loves learning】
LeetCode Exercise set
Some questions may be skipped directly , Brush before tidying up leetcode
752. Open the turntable lock
You have a turntable lock with four round pulleys . Every wheel has 10 A digital : ‘0’, ‘1’, ‘2’, ‘3’, ‘4’, ‘5’, ‘6’, ‘7’, ‘8’, ‘9’ . Each wheel can rotate freely : For example, put ‘9’ Turn into ‘0’,‘0’ Turn into ‘9’ . Each rotation can only rotate one digit of a wheel .
The initial number of locks is ‘0000’ , A string representing the number of four dials .
list deadends Contains a set of death figures , Once the number of dials is the same as any element in the list , This lock will be permanently locked , Can't be rotated again .
character string target Represents a number that can be unlocked , You need to give the minimum number of rotations , If you can't unlock it anyway , return -1.
Tips :
Death list deadends The length range of is [1, 500].
Target number target Not in deadends In .
Every deadends and target The number of strings in will be in 10,000 A possible situation ‘0000’ To ‘9999’ Produced in .
753. Crack the safe
There's a safe that needs a password to open . The password is n digit , Every bit of the code is k Bit sequence 0, 1, …, k-1 One of them .
You can enter the password as you like , The safe will automatically remember the last n An input , If the match , You can open the safe .
for instance , Suppose the password is “345”, You can type “012345” To open it , It's just that you typed in 6 Characters .
Please return the shortest string that can open the safe .
Example 1:
Input : n = 1, k = 2
Output : “01”
explain : "10" You can also open the safe .
Example 2:
Input : n = 2, k = 2
Output : “00110”
explain : “01100”, “10011”, “11001” You can open the safe, too .
Tips :
n The range is [1, 4].
k The range is [1, 10].
k^n The most likely is 4096.
PS:
Should say no , Baidu translation is better than this
754. The number at the end of the line
On an infinite number axis , You are standing 0 The location of . End at target The location of .
Every time you choose to move left or right . The first n Secondary mobility ( from 1 Start ), You can go n Step .
Return to the minimum number of moves required to reach the destination .
Example 1:
Input : target = 3
Output : 2
explain :
First move , from 0 To 1 .
Second move , from 1 To 3 .
Example 2:
Input : target = 2
Output : 3
explain :
First move , from 0 To 1 .
Second move , from 1 To -1 .
The third move , from -1 To 2 .
Be careful :
target Is in [-10^9, 10^9] Nonzero integers in the range .
756. Pyramid transformation matrix
Now? , We use some squares to build a pyramid . Each square is represented by a string containing only one letter .
The stacking rules of using triples to represent pyramids are as follows :
For three tuples (A, B, C) ,“C” For the top box , square “A”、“B” As squares “C” The left of the next floor 、 Right sub block . If and only if (A, B, C) Are allowed triples , Before we can pile it up .
At the beginning , The base of a given pyramid bottom, Use a string to represent . A list of allowed triples allowed, Each triplet has a length of 3 String representation of .
If it can be piled from the base to the spire, it will return true, Otherwise return to false.
Be careful :
bottom The length range of is [2, 8].
allowed The length range of is [0, 200].
The marking letter range of the box is {‘A’, ‘B’, ‘C’, ‘D’, ‘E’, ‘F’, ‘G’}.
757. Set the intersection size to at least 2
An integer interval [a, b] ( a < b ) It's about starting from a To b All consecutive integers of , Include a and b.
Give you a set of integer intervals intervals, Please find a minimum set S, bring S Elements and intervals in intervals Every integer interval in has at least 2 Elements intersect .
Output this minimal set S Size .
Example 1:
Input : intervals = [[1, 3], [1, 4], [2, 5], [3, 5]]
Output : 3
explain :
Consider the set S = {2, 3, 4}. S And intervals All four intervals in have at least 2 Intersecting elements .
And this is S In the smallest case , So we export 3.
Example 2:
Input : intervals = [[1, 2], [2, 3], [2, 4], [4, 5]]
Output : 5
explain :
The smallest set S = {1, 2, 3, 4, 5}.
Be careful :
intervals The length range of is [1, 3000].
intervals[i] The length is 2, Left respectively 、 Right border .
intervals[i][j] The value of is [0, 10^8] Range of integers .
边栏推荐
- Qlabel marquee text display
- [paper notes] transunet: transformers make strongencoders for medical image segmentation
- R language uses DT function to generate t-distribution density function data and plot function to visualize t-distribution density function data
- Digital "new" operation and maintenance of energy industry
- 思维导图+源代码+笔记+项目,字节跳动+京东+360+网易面试题整理
- RT-Thread 组件 FinSH 使用时遇到的问题
- 凤凰架构2——访问远程服务
- Mathematical knowledge -- code implementation of Gaussian elimination (elementary line transformation to solve equations)
- 学习探索-函数防抖
- R language ggplot2 visualization: use ggviolin function of ggpubr package to visualize violin diagram
猜你喜欢
spark基础-scala
学习探索-使用伪元素清除浮动元素造成的高度坍塌
史上超级详细,想找工作的你还不看这份资料就晚了
接雨水问题解析
Sanmian ant financial successfully got the offer, and has experience in Android development agency recruitment and interview
Simple understanding of MySQL database
思维导图+源代码+笔记+项目,字节跳动+京东+360+网易面试题整理
How to do smoke test
Documents to be used in IC design process
In depth analysis, Android interview real problem analysis is popular all over the network
随机推荐
Graffiti intelligence is listed on the dual main board in Hong Kong: market value of 11.2 billion Hong Kong, with an annual revenue of 300 million US dollars
三面蚂蚁金服成功拿到offer,Android开发社招面试经验
Mind map + source code + Notes + project, ByteDance + JD +360+ Netease interview question sorting
LeetCode-1279. 红绿灯路口
Simple understanding of MySQL database
中缀表达式转后缀表达式详细思路及代码实现
MATLAB中deg2rad和rad2deg函数的使用
Problems encountered in using RT thread component fish
Zero foundation entry polardb-x: build a highly available system and link the big data screen
R语言ggplot2可视化:使用ggpubr包的ggviolin函数可视化小提琴图
Analysis of frequent chain breaks in applications using Druid connection pools
Modulenotfounderror: no module named 'PIL' solution
R语言使用rchisq函数生成符合卡方分布的随机数、使用plot函数可视化符合卡方分布的随机数(Chi Square Distribution)
pytorch常见损失函数
ACTF 2022圆满落幕,0ops战队二连冠!!
Solution of intelligent management platform for suppliers in hardware and electromechanical industry: optimize supply chain management and drive enterprise performance growth
Cereals Mall - Distributed Advanced p129~p339 (end)
Help improve the professional quality of safety talents | the first stage of personal ability certification and assessment has been successfully completed!
Black Horse - - Redis Chapter
Spark foundation -scala