std::vector example

 

#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
	std::vector<int> line;
	for (int i = 0; i < 10; i++) 
	{ 
		
		int temp = (i%2)? 5*i: -5*i ;
		line.push_back(temp); 
	}

	std::cout << "using integer as loop iterator: " << std::endl;
	for (int i = 0; i < 10; i++)
	{
		std::cout << line[i] << " ";
	}
	std::cout << std::endl;


	std::cout << "using vector<int> :: iterator as loop iterator: " << std::endl;
	std::cout << "Increasing Sorting " << std::endl;
	sort(line.begin(), line.end());
	vector<int>::iterator it;
	for (it = line.begin(); it < line.end(); it++)
	{
		std::cout << *it << " ";
	}
	std::cout << std::endl;

	std::cout << "Decreasing Sorting " << std::endl;
	reverse(line.begin(), line.end());
	for (it = line.begin(); it < line.end(); it++)
	{
		std::cout << *it << " ";
	}
	std::cout << std::endl;


	std::cout << "find example in std::vector<int> " << std::endl;

	int value = 25;
	vector<int>::iterator result = find(line.begin(), line.end(), value);

	if (result == line.end() ) // Not find
		std::cout << value << " could NOT be found " << std::endl;
	else
		std::cout << value << " Found " << std::endl;

	std::cin.get();

	return 0;
}

 

 

 

转载于:https://www.cnblogs.com/ILoveOCT/p/6491223.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值