C++:順序表類實現約瑟夫問題_密碼不同

來源:互聯網
上載者:User

標籤:max   cout   str   efi   iostream   main   for   name   約瑟夫問題   

//.h

#pragma once
#include <iostream>
using namespace std;
#define MAXSIZE 100

template <class T>
class SeqList
{
T data[MAXSIZE];
int length;
public:
SeqList();
SeqList(T a[],int n);
~SeqList();
void Josephus2(int p[], int m0);
void PrintList();
};


template <class T>
SeqList<T>::SeqList()
{
length = 0;
}

template<class T>
SeqList<T>::SeqList(T a[], int n)
{
length = n;
for (int i = 0; i < length; i++)
data[i] = a[i];
}

template <class T>
SeqList<T>::~SeqList()
{
}

template<class T>
void SeqList<T>::Josephus2(int p[], int m0)
{
int k = 1;
int m = m0;
cout << " 出圈順序為:" << endl;
while (length != 0)
{
k--;
int i = (k + m - 1) % length;
cout << data[i] << " ";
m = p[i];
for (int j = i; j < length - 1; j++)
{
data[j] = data[j + 1];
p[j] = p[j + 1];
}
length--;
k = i + 1;
}
cout << endl;
}

template<class T>
void SeqList<T>::PrintList()
{
for (int i = 0; i < length; i++)
cout << data[i] << " ";
cout << endl;
}

 

// 約瑟夫問題 密碼不同.cpp : 定義控制台應用程式的進入點。
//主函數

#include "stdafx.h"
#include "SeqList.h"
#include <iostream>
using namespace std;

int main()
{
int a[6] = { 1,2,3,4,5,6 };
int b[6] = { 1,2,3,4,5,6 };

SeqList<int> s(a,6);
s.PrintList();
s.Josephus2(b,3);

system("PAUSE");
return 0;
}

 

C++:順序表類實現約瑟夫問題_密碼不同

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.