题目描述：
LeetCode 854. K-Similar Strings
Strings A and B are K-similar (for some non-negative integer K) if we can swap the positions of two letters in A exactly K times so that the resulting string equals B.
Given two ...
类别归档：LeetCode
LeetCode OJ is a platform for preparing technical coding interviews.
[LeetCode]K-Similar Strings
[LeetCode]Exam Room
作者是
发布于
在
LeetCode.
题目描述：
In an exam room, there are N seats in a single row, numbered 0, 1, 2, ..., N-1.
When a student enters the room, they must sit in the seat that maximizes the distance to the ...
[LeetCode]Car Fleet
作者是
发布于
在
LeetCode.
题目描述：
N cars are going to the same destination along a one lane road. The destination is target miles away.
Each car i has a constant speed speed[i] (in miles per hour), and ...
[LeetCode]Shortest Path Visiting All Nodes
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 847. Shortest Path Visiting All Nodes
An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1) is given as graph.
graph.length = N, and j != i is in the list graph[i] exactly once, if and ...
[LeetCode]Longest Mountain in Array
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 845. Longest Mountain in Array
Let's call any (contiguous) subarray B (of A) a mountain if the following properties hold:
B.length >= 3- There exists some
0 < i < B.length - 1such thatB[0] < ...