如果您对[Swift]LeetCode436.寻找右区间|FindRightInterval感兴趣，那么本文将是一篇不错的选择，我们将为您详在本文中，您将会了解到关于[Swift]LeetCode43

如果您对[Swift]LeetCode436. 寻找右区间 | Find Right Interval感兴趣，那么本文将是一篇不错的选择，我们将为您详在本文中，您将会了解到关于[Swift]LeetCode436. 寻找右区间 | Find Right Interval的详细内容，并且为您提供关于book.find() 操作 `books.find()` 缓冲在 10000 毫秒后超时 Heroku 错误、c – 为什么std :: find(s.begin(),s.end(),val)对于一个s来说比s.find(val)慢1000？、C++ find（STL find）查找算法详解、css – “margin-left”和“left”(或“margin-right”和“right”)之间的差异的有价值信息。

• [Swift]LeetCode436. 寻找右区间 | Find Right Interval
• book.find() 操作 `books.find()` 缓冲在 10000 毫秒后超时 Heroku 错误
• c – 为什么std :: find(s.begin(),s.end(),val)对于一个s来说比s.find(val)慢1000？
• C++ find（STL find）查找算法详解
• css – “margin-left”和“left”(或“margin-right”和“right”)之间的差异

[Swift]LeetCode436. 寻找右区间 | Find Right Interval

Input: [ [1,2] ]

Output: [-1]

Explanation: There is only one interval in the collection,so it outputs -1. 

Input: [ [3,4],[2,3],[1,2] ]

Output: [-1,1]

Explanation: There is no satisfied "right" interval for [3,4].
For [2,the interval [3,4] has minimum-"right" start point;
For [1,2],the interval [2,3] has minimum-"right" start point. 

Input: [ [1,[3,4] ]

Output: [-1,2,-1]

Explanation: There is no satisfied "right" interval for [1,4] and [3,4] has minimum-"right" start point.

输入: [ [1,2] ]
输出: [-1]

解释:集合中只有一个区间，所以输出-1。

输入: [ [3,2] ]
输出: [-1,1]

解释:对于[3,4]，没有满足条件的“右侧”区间。
对于[2,3]，区间[3,4]具有最小的“右”起点;
对于[1,2]，区间[2,3]具有最小的“右”起点。

输入: [ [1,4] ]
输出: [-1,-1]

解释:对于区间[1,4]和[3,4]有最小的“右”起点。

5324ms

 1 /**
 2  * DeFinition for an interval.
 3  * public class Interval {
 4  *   public var start: Int
 5  *   public var end: Int
 6  *   public init(_ start: Int,_ end: Int) {
 7  *     self.start = start
 8  *     self.end = end
 9  *   }
10  * }
11  */
12 class Solution {
13     func findRightInterval(_ intervals: [Interval]) -> [Int] {
14         var res:[Int] = [Int]()
15         var v:[Int] = [Int]()
16         var m:[Int:Int] = [Int:Int]()
17         for i in 0..<intervals.count
18         {
19             m[intervals[i].start] = i
20             v.append(intervals[i].start)
21         }
22         v = v.sorted(by:>)
23         for a in intervals
24         {
25             var i:Int = 0
26             while(i < v.count)
27             {
28                 if v[i] < a.end
29                 {
30                     break
31                 }
32                 i += 1                
33             }
34             res.append((i > 0) ? m[v[i - 1]]! : -1)
35         }
36         return res
37     }
38 }

book.find() 操作 `books.find()` 缓冲在 10000 毫秒后超时 Heroku 错误

如何解决book.find() 操作 `books.find()` 缓冲在 10000 毫秒后超时 Heroku 错误

在本地主机上一切正常，但是当我打开服务器时，我在 Heroku 上遇到了这个错误

2021-06-01T22:42:01.580808+00:00 app[web.1]: MongooseError: Operation books.find() 缓冲在 10000 毫秒后超时

2021-06-01T22:42:01.580809+00:00 app[web.1]：超时。 (/app/node_modules/mongoose/lib/drivers/node-mongodb-native/collection.js:185:20)

2021-06-01T22:42:01.580809+00:00 app[web.1]: at listOnTimeout (node:internal/timers:557:17)

2021-06-01T22:42:01.580809+00:00 app[web.1]: at processtimers (node:internal/timers:500:7)

这是我的代码， 路由器

router.get("/",async (req,res) => {
  const books = await bookModel.find();
  if (!books) {
    res.status(500).json({ success: false });
  }
  res.send(books);
});
router.get("/:id",res) => {
  const books = await bookModel.findById(req.params.id);
  if (!books) {
    res.status(500).json({ success: false });
  }
  res.send(books);
});

型号

const mongoose = require("mongoose");
const bookSchema = mongoose.Schema({
  name: String,price: Number,image: String,});
exports.bookModel = mongoose.model("Book",bookSchema);

app.js

const express = require("express");
const mongoose = require("mongoose");
const app = express();
const booksRouter = require("./routes/books");
app.use(express.json());
app.use("/books",booksRouter);
app.get("/",(req,res) => {
  res.send("Hello");
});
mongoose
  .connect(
    "mongodb+srv://*****:*******@cluster0.f0bzw.mongodb.net/**********?retryWrites=true&w=majority",{
      dbname: "*********",useNewUrlParser: true,useUnifiedTopology: true,}
  )
  .then(console.log("Connected"))
  .catch((err) => console.log(err));
let port = process.env.PORT || 3000;
app.listen(port);

c – 为什么std :: find(s.begin(),s.end(),val)对于一个s来说比s.find(val)慢1000？

set<int> s;

for (int i = 0; i < 100000; i++)
    s.insert(rand());

for (int i = 0; i < 10000; i++) {
    int r = rand();

    //first find is about 1000x slower than the next one
    auto iter1 = std::find(s.begin(),s.end(),r);
    auto iter2 = s.find(r);
}

Elements  Vector     List      Set    | Set.Find()
      10   0.0017    0.0017    0.0020  |  0.0017
     100   0.0028    0.0051    0.0120  |  0.0019
    1000   0.0105    0.0808    0.1495  |  0.0035
   10000   0.0767    0.7486    2.7009  |  0.0068
  100000   0.2572    2.4700    6.9636  |  0.0080
 1000000   0.2674    2.5922    7.0149  |  0.0082
10000000   0.2728    2.6485    7.0833  |  0.0082

C++ find（STL find）查找算法详解

std::vector<int> numbers {5,46,-5,-6,23,17,5,9,6,5};
int value {23};
auto iter = std::find(std::begin(numbers),std::end(numbers),value);
if (iter != std:: end (numbers))
    std::cout << value << " was found. \n";

size_t count {};
int five {5};
auto start_iter = std::begin(numbers);
auto end_iter = std::end(numbers);
while((start_iter = std::find(start_iter,end_iter,five)) != end_iter)
{
    ++count;
    ++start_iter;
}
std::cout << five << " was found " << count << " times." << std::endl; // 3 times

css – “margin-left”和“left”(或“margin-right”和“right”)之间的差异

<div id = "testBox">
  <img src = "http://www.dummyimage.com/300x200" id = "first">
  <img src = "http://www.dummyimage.com/300x200" id = "second">
</div>

img{ display:block; }
#first{ margin-top:50px; }

img{display:block;}
#first{position:relative; top:50px;}

关于[Swift]LeetCode436. 寻找右区间 | Find Right Interval的介绍现已完结，谢谢您的耐心阅读，如果想了解更多关于book.find() 操作 `books.find()` 缓冲在 10000 毫秒后超时 Heroku 错误、c – 为什么std :: find(s.begin(),s.end(),val)对于一个s来说比s.find(val)慢1000？、C++ find（STL find）查找算法详解、css – “margin-left”和“left”(或“margin-right”和“right”)之间的差异的相关知识，请在本站寻找。