leetcode 406 Queue Reconstruction by Height C++
来源:互联网 发布:不是数据库系统的特点 编辑:程序博客网 时间:2024/05/21 12:40
这个题有思路,但是太麻烦,后来看了discuss,发现解法very精妙,直接拿来用了,并且熟悉了一下auto和sort函数
vector<pair<int, int>> reconstructQueue(vector<pair<int, int>>& people) { vector<pair<int,int>> result; sort(people.begin(),people.end(),[](pair<int,int>a,pair<int,int>b){ return a.first>b.first||(a.first==b.first&&a.second<b.second); }); for(auto p : people){ result.insert(result.begin() + p.second,p); } return result; }
0 0
- LeetCode[406] Queue Reconstruction by Height
- LeetCode #406: Queue Reconstruction by Height
- leetcode 406 Queue Reconstruction by Height C++
- Leetcode 406 Queue Reconstruction by Height
- [leetcode 406]Queue Reconstruction by Height
- LeetCode 406 Queue Reconstruction by Height
- Leetcode#406 Queue Reconstruction by Height
- Leetcode Queue Reconstruction by Height
- leetcode---Queue Reconstruction by Height
- LeetCode-Queue Reconstruction by Height
- 【406】 Queue Reconstruction by Height
- LeetCode 406. Queue Reconstruction by Height 题解(C++)
- LeetCode 406 Queue Reconstruction by Height (排序 思维)
- leetcode 406- Queue Reconstruction by Height 贪心算法的应用
- Leetcode算法学习日志-406 Queue Reconstruction by Height
- LeetCode#406 Queue Reconstruction by Height题解(C++版)
- LeetCode—406. Queue Reconstruction by Height
- [LeetCode]406.Queue Reconstruction by Height
- 微信开发实战(4)—URL、Token认证、java源码、免费新浪SAE部署
- JAVA多线程实现和应用总结
- gradle脚本入门
- jenkins 创建用户角色项目权限
- HDOJ 2002-计算球体积
- leetcode 406 Queue Reconstruction by Height C++
- 润乾报表参数传递那些事
- vmware下虚拟机centos 桥接上网
- 圆形按钮的实现
- Verilog中assign君和always酱
- GitHub优秀项目使用攻略之Sweet Alert Dialog
- Android中native进程内存泄露的调试技巧(一)-- libc debug
- VR平台开发笔记(二)关于提示的一些做法
- SpringMVC框架项目访问不到静态资源问题