算法
文章平均质量分 77
hongjunbj
这个作者很懒,什么都没留下…
展开
-
队列另一种实现(链表)
头文件typedef struct Node{ int val; Node *next; Node(){next=NULL;} Node(int v) { val = v; next = NULL; }}Node;class QueueList{public: QueueList(int max); ~QueueList(); int pop(); vo原创 2014-02-21 16:43:59 · 524 阅读 · 0 评论 -
队列的一种实现(数组)
头文件const int MAX_QUEUE_NUM = 4;class Queue{public: Queue(); ~Queue(); int pop(); void push(int x); int getFront() const; int count();private: int m_pos;//记录第一个元素的位置 int m_count; int m原创 2014-02-20 17:17:28 · 573 阅读 · 0 评论 -
栈的一种实现(数组)
头文件const int MAX_STACK_NUM = 4;class Stack{public: Stack(); ~Stack(); int pop(); void push(int x); int peek() const; int count();private: int m_pos;//m_pos-1为栈顶元素的位置 int m_data[MAX_STA原创 2014-02-20 17:22:14 · 536 阅读 · 0 评论 -
Apollo Rule Reverse
1. The string consist of ASCII characters.2. There are three types of segment in string: word, non-word and "#".Word begins with letter which can be followed with every character except ‘#’(e.g. ‘原创 2014-04-02 20:59:24 · 604 阅读 · 0 评论 -
The minimum number of elements to reach the end of an array
Given an array of integers, each element represents the max number of jumps that you can move forward.Write a piece of code to find out the minimum number of elements you need to select to reach the原创 2014-04-02 21:41:33 · 691 阅读 · 0 评论 -
Game of Paper, Rock and scissors
Paper-Scissors-Rock is a game for two players. Each player simultaneously opens his/her hand to display a symbol:* Fist equals rock,* Open hand equals paper,* Showing the index and middle finger原创 2014-04-25 22:17:57 · 980 阅读 · 0 评论 -
几种常见排序算法的实现(冒泡法,选择法,插入法,快速排序、堆排序)
#include "stdafx.h"//in the i th round ordering, j always points to the max element so farvoid bubble_sort(int *a, int len){ for(int i=0; i<len-1; i++) { for(int j=0; j<len-1-i; j++) { if原创 2014-05-13 23:05:49 · 695 阅读 · 0 评论