【面试题】剑指offer 8
来源:互联网 发布:windows桌面更新多久 编辑:程序博客网 时间:2024/05/16 05:22
统计数组中各个数字出现的次数
#include <iostream>using namespace std;void SortAge(int ages[],int length){if (ages==NULL||length<=0) return;const int oldestage=99;int timesages[oldestage+1]={0};for (int i=0;i<length;i++){int age=ages[i];if(ages<0||age>oldestage){ cout<<"年龄输入错误"<<endl;return;}++timesages[age];}int index=0;for(int i=0;i<=oldestage;i++){for(int j=0;j<timesages[i];j++){ages[index]=i;++index;}}for (int i=1;i<=oldestage;i++){if(timesages[i])cout<<i<<":"<<timesages[i]<<endl;}}void test(){int ages[]={12,3,42,54,4,32,12,6,3,12,12,1,23,4,5,3,2,13,4,43,2,1};SortAge(ages,sizeof(ages)/sizeof(int));}
把一个数组最开始的若干数字移到数组末尾,求该数组的最小数
#include <iostream>using namespace std;int minorder(int* num,int index1,int index2){int result=num[index1];for(int i=index1+1;i<=index2;i++){if(result>num[i])result=num[i];}return result;}int MinData(int* num,int length){if(num==NULL||length<=0){cout<<"数组为空"<<endl;return 0;}int index1=0;int index2=length-1;int midindex=index1;while (num[index1]>=num[index2]){if(index2-index1==1){midindex=index2;break;}midindex=(index1+index2)/2;if(num[index1]==num[index2]&&num[midindex]==num[index1]){return minorder(num,index1,index2);}if(num[midindex]>=num[index1]){index1=midindex;}else if (num[midindex]<=num[index2]){index2=midindex;}}return num[midindex];}void testmin(){int arr[]={3,4,5,1,2};int arr1[]={4,5,6,0,1};int arr2[]={1,0,0,0,0};int arr3[]={1,1,1,0,1};cout<<MinData(arr,sizeof(arr)/sizeof(int))<<endl;cout<<MinData(arr1,sizeof(arr1)/sizeof(int))<<endl;cout<<MinData(arr2,sizeof(arr2)/sizeof(int))<<endl;cout<<MinData(arr3,sizeof(arr3)/sizeof(int))<<endl;}测试代码
#include "SortAge.h"#include "MinData.h"int main(){ test();testmin();system("pause");return 0;}
0 0
- 剑指offer面试题8
- 剑指offer 面试题8
- 剑指offer面试题8
- 【面试题】剑指offer 8
- 剑指offer 面试题
- 剑指offer面试题
- 剑指offer面试题8--数组旋转
- 剑指Offer(面试题8~10)
- 剑指Offer面试题8 & Leetcode153
- 剑指offer面试题总结
- 剑指offer面试题06
- 剑指offer面试题 04
- 剑指offer 面试题07
- 剑指offer面试题08
- 剑指offer面试题42
- 剑指offer面试题1
- 剑指offer面试题3
- 剑指offer面试题4
- ACM英语积累
- [Leetcode] Container With Most Water
- 数据压缩
- 简版DBHelper类
- Data类与DataFormat类
- 【面试题】剑指offer 8
- SpringCloud Zuul
- java se基础版----- 基础语法
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) C. Molly's Chemicals
- 选择类控件-----ComboBox控件---CheckBox控件
- 回文数字判断
- php 无限分类递归及其排序详细解读
- Java笔试面试题整理第三波
- Romantic(扩展欧几里得)注意数据范围