Guang lianda beiyou pen exam, Guang lianda beiyou exam

Guang lianda beiyou pen exam, Guang lianda beiyou exam

Guang lianda beiyou lecture pen questions

Programming questions

1. Compared with arrays, linked lists do not have the following advantages: small storage space.

2. A group of people of different ages, find the minimum age difference (absolute value), the time complexity is less than O (n ^ 2)

My idea is: sort the ages (from small to large) in a quick sort, and then subtract the minimum age from the next age to the minimum age.

3. Delete the given node of the one-way linked list. The time complexity is O (1)

Linked List node definition:

Struct linknode {

Int key;

Linknode * next

}

This is the topic of the offoffoffer.

Idea: overwrite the value of the given node with the value of the next node of the given node, and then delete the next node.

Assume that the given node is p

P-> key = p-> next-> key;

P-> next = p-> next;

4. Determine whether a binary tree is a balanced binary tree.

Binary Tree definition:

Struct node {

Int data;

Node * left;

Node * right;

}

I forgot what a balanced binary tree is...

Reference blog: http://blog.csdn.net/zz198808/article/details/7621275

5. Determine whether the given string operator does not comply with the given syntax rules.

Sentence: Verb

String: Sentence Conjunction Sentence

Noun: "Bird", "Fish" etc

Verb: "Fly" etc

Conjunction: "and", "or", "not"

At that time, I had no idea how to break down words from strings.

The logic questions of disgusting people are not detailed... It won't do it anyway...

Test engineers of guanglianda (architecture, not software development)

This is not clear.

Beiyou network research institute review pen questions, urgent

You can go to Shengshi qingbei to ask them if they have beiyou review tutoring classes and insurance classes, but they can refund the money. This shows the strength of tutoring.