[codility]Prefix-set
来源:互联网 发布:windows引导命令 编辑:程序博客网 时间:2024/06/03 16:29
// you can also use includes, for example:// #include <algorithm>int solution(const vector<int> &A) { // write your code in C++98 //...keep record of all the elements that exist in the array vector<bool> existNum(A.size(), false); int distinctNumCnt = 0; for(int i = 0; i < A.size(); ++i) { if(!existNum[A[i]]) distinctNumCnt++; existNum[A[i]] = true; } //...then, check if all the elements show up so far int curDistinctNumCnt = 0; for(int i = 0; i < A.size(); ++i) { if(existNum[A[i]]) { existNum[A[i]] = false; curDistinctNumCnt++; } if(curDistinctNumCnt == distinctNumCnt) return i; } }
- [codility]Prefix-set
- prefix set
- codility
- codility
- 如何删除npm之前设置的npm config set prefix...
- 如何删除npm之前设置的npm config set prefix...
- prefix
- Codility -- Fish
- Codility -- Brackets
- Codility -- grocery_store
- Codility -- Triangle
- [codility]Triangle
- [codility]Brackets
- [codility]Fish
- [codility]Dominator
- [codility]Equi
- [codility]equi
- [codility]MinAbsSumOfTwo
- java 反射机制
- [codility]Tree-height
- 程控交换课外实习报告
- Android 的 init.rc 文件简介
- OpenRisc-58-ORPSoC调试环境的构建
- [codility]Prefix-set
- UVA 10803 - Thunder Mountain(floyd)
- [codility]Array-inversion-count
- 时分复用
- LeetCode Letter Combinations of a Phone Number 经典组合问题
- Linux input子系统分析 事件处理层分析
- [codility]Falling-discs
- 敏捷的商业价值是什么,与传统对比的特点是什么?
- Android源码开发环境搭建