SAP的面试题

最新推荐文章于 2024-08-23 16:50:30 发布

jemmy

最新推荐文章于 2024-08-23 16:50:30 发布

阅读量2.6k

点赞数

文章标签： sap 面试 class iostream constructor

本文链接：https://blog.youkuaiyun.com/jemmy/article/details/470026

版权

博客围绕C++面试编程问题展开，包含用模板重写数组查找函数以消除依赖，处理类构造函数中内存分配失败问题，分析类和变量定义相关选择题，实现单例模式，列举排序算法并按平均时间复杂度排序，以及对双向链表排序等内容。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1.Below is usual way we find one element in an array:
const int *find1(const int* array, int n, int x)
{
    const int* p = array;
    for(int i = 0; i < n; i++)
    {
        if(*p == x)
        {
            return p;
        }
        ++p;
    }
    return 0;
}
In this case we have to bear the knowledge of value type "int", the size of
array,
even the existence of an array. Would you re-write it using template to elim
inate all
these dependencies?
2. Assume you have a class like
class erp
{
    HR* m_hr;
    FI* m_fi;
public:
    erp()
    {
        m_hr = new HR();
        m_fi = new FI();
    }
    ~erp()
    {
    }
};
if "new FI()" failed in the constructor, how can you detect this problem and
release the
properly allocated member pointer m_hr?
3. Check the class and variable definition below:
#include <iostream>
#include <complex>
using namespace std;
class Base
{
public:
    Base() { cout<<"Base-ctor"<<endl; }
    ~Base() { cout<<"Base-dtor"<<endl; }
    virtual void f(int) { cout<<"Base::f(int)"<<endl; }
    virtual void f(double) {cout<<"Base::f(double)"<<endl; }
    virtual void g(int i = 10) {cout<<"Base::g()"<<i<<endl; }
};
class Derived: public Base
{
public:
    Derived() { cout<<"Derived-ctor"<<endl; }
    ~Derived() { cout<<"Derived-dtor"<<endl; }
    void f(complex<double>) { cout<<"Derived::f(complex)"<<endl; }
    virtual void g(int i = 20) {cout<<"Derived::g()"<<i<<endl; }
};
Base b;
Derived d;
Base* pb = new Derived;
Select the correct one from the four choices:
Cout<<sizeof(Base)<<endl;
A. 4    B.32    C.20    D.Platform-dependent
Cout<<sizeof(Base)<<endl;
A. 4    B.8 C.36    D.Platform-dependent
pb->f(1.0);
A.Derived::f(complex)   B.Base::f(double)
pb->g();
A.Base::g() 10      B.Base::g() 20
C.Derived::g() 10   D.Derived::g() 20
4.Implement the simplest singleton pattern(initialize if if necessary).
5.Name three sort algorithms you are familiar with. Write out the correct or
der by the
average time complexity.
6.Write code to sort a duplex direction linklist. The node T has overridden
the comparision operators