blocks|key|649127|text|标准算法|type|header-one|depth|inlineStyleRanges|entityRanges|data|649128|您可以更多地使用标准算法。例如，考虑一下您的queuesEmpty：|unstyled|offset|length|style|CODE|649129|bool+queuesEmpty(Queues&+queues)
{
++for(const+auto&+queue+:+queues)+{
++++if(!queue.empty())+{
++++++return+false;
++++}
++}
++return+true;
}|code-block|syntax|javascript|649130|如果有选择的话，我可能会写得更像：|649131|bool+queuesEmpty(Queues&+queues)+{
++++return+std::all_of(queues.begin(),+queues.end(),+[](auto+const+&q)+{+return+q.empty();+});
}|entityMap^0|0|M|B|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@$E|U|F|V|G|H]]|9|@]|A|$]]|$1|I|3|J|5|K|7|W|8|@]|9|@]|A|$L|M]]|$1|N|3|O|5|D|7|X|8|@]|9|@]|A|$]]|$1|P|3|Q|5|K|7|Y|8|@]|9|@]|A|$L|M]]]|R|$]]

<h3>Standard Algorithms</h3>
You can make more use of standard algorithms. For one example consider your <code>queuesEmpty</code>:
<pre class="lang-cpp prettyprint-override"><code>bool queuesEmpty(Queues&amp; queues)
{
 for(const auto&amp; queue : queues) {
 if(!queue.empty()) {
 return false;
 }
 }
 return true;
}
</code></pre>
Given a choice, I'd probably write this more like:
<pre class="lang-cpp prettyprint-override"><code>bool queuesEmpty(Queues&amp; queues) {
 return std::all_of(queues.begin(), queues.end(), [](auto const &amp;q) { return q.empty(); });
}
</code></pre>
[I'll probably add more later.]

I solved the following Kata on Codewars:
<a href="https://www.codewars.com/kata/58905bfa1decb981da00009e/train/cpp" rel="nofollow noreferrer">https://www.codewars.com/kata/58905bfa1decb981da00009e/train/cpp</a>
It was a lot of fun to solve it.
Here everything you need to know so no need to use the link.
<blockquote>
Synopsis A multi-floor building has a Lift in it.
People are queued on different floors waiting for the Lift.
Some people want to go up. Some people want to go down.
The floor they want to go to is represented by a number (i.e. when
they enter the Lift this is the button they will press)
<pre><code>BEFORE (people waiting in queues) AFTER (people at their destinations)
 +--+ +--+ 
 /----------------| |----------------\ /----------------| |----------------\
10| | | 1,4,3,2 | 10| 10 | | |
 |----------------| |----------------| |----------------| |----------------|
 9| | | 1,10,2 | 9| | | |
 |----------------| |----------------| |----------------| |----------------|
 8| | | | 8| | | |
 |----------------| |----------------| |----------------| |----------------|
 7| | | 3,6,4,5,6 | 7| | | |
 |----------------| |----------------| |----------------| |----------------|
 6| | | | 6| 6,6,6 | | |
 |----------------| |----------------| |----------------| |----------------|
 5| | | | 5| 5,5 | | |
 |----------------| |----------------| |----------------| |----------------|
 4| | | 0,0,0 | 4| 4,4,4 | | |
 |----------------| |----------------| |----------------| |----------------|
 3| | | | 3| 3,3 | | |
 |----------------| |----------------| |----------------| |----------------|
 2| | | 4 | 2| 2,2,2 | | |
 |----------------| |----------------| |----------------| |----------------|
 1| | | 6,5,2 | 1| 1,1 | | |
 |----------------| |----------------| |----------------| |----------------|
 G| | | | G| 0,0,0 | | |
 |====================================| |====================================|
</code></pre>
Rules
Lift Rules
<ul>
<li>The Lift only goes up or down!
</li>
<li>Each floor has both UP and DOWN Lift-call buttons (except top and ground floors which have only DOWN and UP respectively)
</li>
<li>The Lift never changes direction until there are no more people wanting to get on/off in the direction it is already travelling
</li>
<li>When empty the Lift tries to be smart. For example,
</li>
<li>If it was going up then it may continue up to collect the highest floor person wanting to go down
</li>
<li>If it was going down then it may continue down to collect the lowest floor person wanting to go up
</li>
<li>The Lift has a maximum capacity of people
</li>
<li>When called, the Lift will stop at a floor even if it is full, although unless somebody gets off nobody else can get on!
</li>
<li>If the lift is empty, and no people are waiting, then it will return to the ground floor
</li>
</ul>
People Rules
<ul>
<li>People are in &quot;queues&quot; that represent their order of arrival to wait for the Lift
</li>
<li>All people can press the UP/DOWN Lift-call buttons
</li>
<li>Only people going the same direction as the Lift may enter it
</li>
<li>Entry is according to the &quot;queue&quot; order, but those unable to enter do not block those behind them that can
</li>
<li>If a person is unable to enter a full Lift, they will press the UP/DOWN Lift-call button again after it has departed without them
</li>
</ul>
Kata Task
<ul>
<li>Get all the people to the floors they want to go to while obeying the Lift rules and the People rules
</li>
<li>Return a list of all floors that the Lift stopped at (in the order visited!)
</li>
</ul>
NOTE: The Lift always starts on the ground floor (and people waiting
on the ground floor may enter immediately)
I/O
Input
<ul>
<li>queues a list of queues of people for all floors of the building.
</li>
<li>The height of the building varies
</li>
<li>0 = the ground floor
</li>
<li>Not all floors have queues
</li>
<li>Queue index [0] is the &quot;head&quot; of the queue
</li>
<li>Numbers indicate which floor the person wants go to
</li>
<li>capacity maximum number of people allowed in the lift
</li>
<li>Parameter validation - All input parameters can be assumed OK. No need to check for things like:
<ul>
<li>People wanting to go to floors that do not exist</li>
<li>People wanting to take the Lift to the floor they are already on</li>
<li>Buildings with &lt; 2 floors</li>
<li>Basements</li>
</ul>
</li>
</ul>
Output
A list of all floors that the Lift stopped at (in the order visited!)
</blockquote>
I solved this with C++. Here is the code with basic tests:
<pre><code>#include &lt;algorithm&gt;
#include &lt;cassert&gt;
#include &lt;vector&gt;
#include &lt;optional&gt;
#include &lt;set&gt;

enum class Direction{
 up,
 down
};

using Queues = std::vector&lt;std::vector&lt;int&gt;&gt;;

bool queuesEmpty(Queues&amp; queues)
{
 for(const auto&amp; queue : queues) {
 if(!queue.empty()) {
 return false;
 }
 }
 return true;
}

void movePeopleIntoLift(std::multiset&lt;int&gt;&amp; passengers, 
 std::vector&lt;int&gt;&amp; peopleOnFloor, std::vector&lt;int&gt;&amp; newPassengers) 
{
 for(const auto&amp; newPassenger : newPassengers) {
 peopleOnFloor.erase(std::find(peopleOnFloor.begin(), peopleOnFloor.end(), 
 newPassenger));
 }

 for(const auto&amp; newPassenger : newPassengers) {
 passengers.insert(newPassenger);
 }
}

std::optional&lt;int&gt; highestFloorAboveLiftPushedDown(int liftPos, 
 const Queues&amp; queues) 
{
 for(std::size_t i = queues.size() -1; i != static_cast&lt;std::size_t&gt;(liftPos); 
 --i) {
 for(const auto&amp; person : queues[i]) {
 if(person &lt; i) { // person wants to go down
 return {i};
 }
 }
 }
 return {};
}

std::optional&lt;int&gt; nextFloorAboveLiftPushedUp(
 int liftPos, const Queues&amp; queues)
{
 if(std::size_t(liftPos) &gt;= queues.size() - 2) {
 return {};
 }
 for(std::size_t i = liftPos + 1; i &lt; queues.size(); ++i) {
 for(const auto&amp; person : queues[i]) {
 if(person &gt; i) {
 return {i};
 }
 }
 }
 return {};
}

std::optional&lt;int&gt; nextFloorUnderLiftPushedDown(
 int liftPos, const Queues&amp; queues)
{
 if(liftPos &lt;= 1) {
 return {};
 }
 for(std::size_t i = liftPos - 1; i!= std::size_t(0) - 1; --i) {
 for(const auto&amp; person : queues[i]) {
 if(person &lt; i) {
 return {i};
 }
 }
 }
 return {};
}


std::optional&lt;int&gt; lowestFloorUnderLiftPushedUp(int liftPos, 
 const Queues&amp; queues) 
{
 for(std::size_t i = 0; i &lt; static_cast&lt;std::size_t&gt;(liftPos); 
 ++i) {
 for(const auto&amp; person : queues[i]) {
 if(person &gt; i) { // person wants to go up
 return {i};
 }
 }
 }
 return {};
}

std::optional&lt;int&gt; passengerDestinationLowerThanLiftPos(int liftPos, 
 const std::multiset&lt;int&gt;&amp; passengers) {
 auto it = std::find_if(passengers.crbegin(), passengers.crend(), 
 [curr = liftPos](int passenger){
 return passenger &lt; curr;
 });
 if(it != passengers.crend()) {
 return {*it};
 }
 return {};
}

std::optional&lt;int&gt; passengerDestinationHigherThanLiftPos(int liftPos, 
 const std::multiset&lt;int&gt;&amp; passengers) {
 auto it = std::find_if(passengers.cbegin(), passengers.cend(), 
 [curr = liftPos](int passenger){
 return passenger &gt; curr;
 });
 if(it != passengers.cend()) {
 return {*it};
 }
 return {};
}

class Lift{
public:
 Lift(const Queues&amp; queues, int capacity);

 void emptyQueues();

 std::vector&lt;int&gt; visitedFloors() const;
private:
 void releasePassengersWithCurrentFloorDestination();

 void goUp();

 void addPeopleWhoWantToGoUp(std::vector&lt;int&gt;&amp; peopleOnFloor);

 bool goUpWithoutPassengers();

 bool goUpToNextFloorPushedUp();
 bool goUpToHighestFloorPushedDown();

 void goUpWithPassengers();

 int getNextFloorUpWithPerson() const;

 void goDown();

 void addPeopleWhoWantToGoDown(std::vector&lt;int&gt;&amp; peopleOnFloor);

 bool goDownWithoutPassengers();

 bool goDownToNextFloorPushedDown();
 bool goDownToLowestFloorPushedUp();


 void goDownWithPassengers();

 int getNextFloorDownWithPerson() const;

 void arriveToFloor(int floor);

 int currentFloor() const;

 void changeDirection();
 Direction direction() const;

 std::multiset&lt;int&gt; mPassangers{};
 std::vector&lt;int&gt; mVisitedFloors{};
 Direction mDirection = Direction::up;
 int mCurrentFloor = 0;
 int mCapacity;
 
 Queues mQueues;
};

Lift::Lift(const Queues&amp; queues, int capacity)
 :mQueues{queues}, mCapacity{capacity}
{
}

void Lift::emptyQueues()
{ 
 arriveToFloor(0);
 bool goToStartPosition = false;
 for(;;) {
 while(mDirection == Direction::up) {
 goUp();
 }
 while(mDirection == Direction::down) {
 goDown();

 if(queuesEmpty(mQueues) &amp;&amp; mPassangers.empty()) {
 goToStartPosition = true;
 break;
 }
 }
 if(goToStartPosition) {
 break;
 }
 }
 if(mCurrentFloor != 0) {
 arriveToFloor(0);
 }
}

std::vector&lt;int&gt; Lift::visitedFloors() const
{
 return mVisitedFloors;
}

void Lift::releasePassengersWithCurrentFloorDestination()
{
 mPassangers.erase(mCurrentFloor);
}

void Lift::goUp()
{
 releasePassengersWithCurrentFloorDestination();
 addPeopleWhoWantToGoUp(mQueues[mCurrentFloor]);
 if(mPassangers.empty()) {
 if(goUpToNextFloorPushedUp()) {
 return;
 }
 if(goUpToHighestFloorPushedDown()) {
 changeDirection();
 addPeopleWhoWantToGoDown(mQueues[mCurrentFloor]);
 return;
 }
 changeDirection();
 }
 else {
 goUpWithPassengers();
 }
}

void Lift::addPeopleWhoWantToGoUp(std::vector&lt;int&gt;&amp; peopleOnFloor)
{
 std::vector&lt;int&gt; newPassengers;

 for(const auto&amp; person : peopleOnFloor) {
 if(newPassengers.size() + mPassangers.size() &gt;= mCapacity) {
 break;
 }
 if(person &gt; mCurrentFloor) {
 newPassengers.push_back(person);
 }
 }

 movePeopleIntoLift(mPassangers, peopleOnFloor, newPassengers);
}

bool Lift::goUpToNextFloorPushedUp()
{
 auto optNextFloorUp = nextFloorAboveLiftPushedUp(
 mCurrentFloor, mQueues);
 if(optNextFloorUp) {
 arriveToFloor(*optNextFloorUp);
 return true;
 }
 return false;
}

bool Lift::goUpToHighestFloorPushedDown()
{
 auto optHighestFloorDown = highestFloorAboveLiftPushedDown(
 mCurrentFloor, mQueues);
 if(optHighestFloorDown) {
 arriveToFloor(*optHighestFloorDown);
 return true;
 }
 return false;
}

void Lift::goUpWithPassengers()
{
 auto higherFloor = getNextFloorUpWithPerson();
 arriveToFloor(higherFloor);
}

int Lift::getNextFloorUpWithPerson() const
{
 auto itPosPassengerUp = std::find_if(mPassangers.cbegin(), mPassangers.cend(), 
 [curr = mCurrentFloor](const auto&amp; val)
 {
 return val &gt; curr;
 }
 );

 // there should be always a person who wants to get higher
 assert(itPosPassengerUp != mPassangers.cend());
 
 auto optPosUp = nextFloorAboveLiftPushedUp(
 mCurrentFloor, mQueues);
 if(optPosUp &amp;&amp; *optPosUp &lt; *itPosPassengerUp) {
 return *optPosUp;
 }
 return *itPosPassengerUp;
}

void Lift::goDown()
{
 releasePassengersWithCurrentFloorDestination();
 addPeopleWhoWantToGoDown(mQueues[mCurrentFloor]);
 if(mPassangers.empty()) {
 if(goDownToNextFloorPushedDown()) {
 return;
 }
 if(goDownToLowestFloorPushedUp()) {
 changeDirection();
 addPeopleWhoWantToGoUp(mQueues[mCurrentFloor]);
 return;
 }
 if(!queuesEmpty(mQueues)) {
 changeDirection();
 }
 }
 else {
 goDownWithPassengers();
 }
}

void Lift::addPeopleWhoWantToGoDown(std::vector&lt;int&gt;&amp; peopleOnFloor)
{
 std::vector&lt;int&gt; newPassengers;

 for(const auto&amp; person : peopleOnFloor) {
 if(newPassengers.size() + mPassangers.size() &gt;= mCapacity) {
 break;
 }
 if(person &lt; mCurrentFloor) {
 newPassengers.push_back(person);
 }
 }

 movePeopleIntoLift(mPassangers, peopleOnFloor, newPassengers);
}

bool Lift::goDownToNextFloorPushedDown()
{
 auto optNextFloorDown = nextFloorUnderLiftPushedDown(
 mCurrentFloor, mQueues);
 if(optNextFloorDown) {
 arriveToFloor(*optNextFloorDown);
 return true;
 }
 return false;
}

bool Lift::goDownToLowestFloorPushedUp()
{
 auto optLowestFloorUp = lowestFloorUnderLiftPushedUp(
 mCurrentFloor, mQueues);
 if(optLowestFloorUp) {
 arriveToFloor(*optLowestFloorUp);
 return true;
 }
 return false;
}

void Lift::goDownWithPassengers()
{
 auto lowerFloor = getNextFloorDownWithPerson();
 arriveToFloor(lowerFloor);
}

int Lift::getNextFloorDownWithPerson() const
{
 auto itPosPassengerDown = std::find_if(mPassangers.crbegin(), mPassangers.crend(), 
 [curr = mCurrentFloor](const auto&amp; val)
 {
 return val &lt; curr;
 }
 );
 // there should be always a person who wants to get down
 assert(itPosPassengerDown != mPassangers.crend());

 auto optPosDown = nextFloorUnderLiftPushedDown(
 mCurrentFloor, mQueues);
 if(optPosDown &amp;&amp; *optPosDown &gt; *itPosPassengerDown) {
 return *optPosDown;
 }
 return *itPosPassengerDown;
}

void Lift::arriveToFloor(int floor)
{
 mCurrentFloor = floor;
 mVisitedFloors.push_back(mCurrentFloor);
}

int Lift::currentFloor() const
{
 return mCurrentFloor;
}

void Lift::changeDirection()
{
 if(mDirection == Direction::up) {
 mDirection = Direction::down;
 }
 else {
 mDirection = Direction::up;
 }
}

Direction Lift::direction() const
{
 return mDirection;
}

std::vector&lt;int&gt; the_lift(std::vector&lt;std::vector&lt;int&gt;&gt; queues, int capacity) 
{
 Lift lift(queues, capacity);
 lift.emptyQueues();
 return lift.visitedFloors();
}

int main()
{
 std::vector&lt;std::vector&lt;int&gt;&gt; queues; std::vector&lt;int&gt; result;

 // lift exactly full
 queues = { {}, {}, {5,5,5,5,5}, {}, {}, {}, {} };
 result = {0, 2, 5, 0};
 assert(the_lift(queues, 5) == result);

 // up
 queues = { {}, {}, {5,5,5}, {}, {}, {}, {} };
 result = {0, 2, 5, 0};
 assert(the_lift(queues, 5) == result);
 
 // down
 queues = { {}, {}, {1,1}, {}, {}, {}, {} };
 result = {0, 2, 1, 0};
 assert(the_lift(queues, 5) == result);
 
 // up and up
 queues = { {}, {3}, {4}, {}, {5}, {}, {} };
 result = {0, 1, 2, 3, 4, 5, 0};
 assert(the_lift(queues, 5) == result);
 
 // down and down
 queues = { {}, {0}, {}, {}, {2}, {3}, {} };
 result = {0, 5, 4, 3, 2, 1, 0};
 assert(the_lift(queues, 5) == result);

 // yoyo
 queues = { {}, {}, {4,4,4,4}, {}, {2, 2, 2, 2}, {}, {} };
 result = {0, 2, 4, 2, 4, 2, 0};
 assert(the_lift(queues, 2) == result);

 // lift full up
 queues = { {3, 3, 3, 3, 3, 3}, {}, {}, {}, {}, {}, {} };
 result = {0, 3, 0, 3, 0};
 assert(the_lift(queues, 5) == result);

 // lift full down
 queues = { {}, {}, {}, {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, {}, {}, {} };
 result = {0, 3, 1, 3, 1, 3, 1, 0};
 assert(the_lift(queues, 5) == result);

 // lift full up and down
 queues = { {3, 3, 3, 3, 3, 3}, {}, {}, {}, {}, {4, 4, 4, 4, 4, 4 }, {} };
 result = {0, 3, 5, 4, 0, 3, 5, 4, 0};
 assert(the_lift(queues, 5) == result);

 // Tricky_queues
 queues = { {}, {0, 0, 0, 6}, {}, {}, {}, {6, 6, 0, 0, 0, 6}, {} };
 result = {0, 1, 5, 6, 5, 1, 0, 1, 0};
 assert(the_lift(queues, 5) == result);

 // Highlander
 queues = { {}, {2}, {3, 3, 3}, {1}, {}, {}, {} };
 result = {0, 1, 2, 3, 1, 2, 3, 2, 3, 0};
 assert(the_lift(queues, 1) == result);

 // Fire drill
 queues = { {}, {0, 0, 0, 0}, {0, 0, 0, 0}, {0, 0, 0, 0}, {0, 0, 0, 0}, {0, 0, 0, 0}, {0, 0, 0, 0} };
 result = {0, 6, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0};
 assert(the_lift(queues, 5) == result); 

}
</code></pre>
As a note. Codewars only allows one file per solution. That's why I have not separated the class in files.
What do you think can be improved?
Is the code easy to read?
Could I have used more algorithms from the standard library?
I feel like I needed a lot of code to get this working.
My approach was like this:
First solve the problem without the required capacity.
Just for that I rewrote the whole thing like 2 or 3 times because I was missing some requirements.
That let me pass the first few tests.
I would also like some hints how its best to tackle a complex problem like this better.
Then I added the capacity and went through the remaining tests. It was like maybe 2 hours of coding and 5h debugging and fixing to pass the tests.

Implementing a Lift (Kata on Codewars)

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

腾讯云开发者社区有与腾讯云相关的官方技术问答，也引入了来自Stack Overflow的优质外文问答。找寻与 实现电梯(Kata on Codewar) 相关的问答，快来腾讯云开发者社区看看吧！

问实现电梯(Kata on Codewar)
EN

回答 1

Code Review用户

标准算法

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问实现电梯(Kata on Codewar)EN