[数据结构]One-Dimensional Life Game

//main.cpp

#include<iostream>
#include<string>
#include"Life.h"
using namespace std;
void main() {
	cout << "**********************************One-Dimensional Life Game**************************************" << endl;
	cout << "please enter the point you want it to live at the beginning(press -1 to end)" << endl;
	cout << "Appendex:the range is 1-30" << endl;
	Life example;
	example.Initialized();
	example.Print();
	char key = 'y';
	bool flag = 1;
	while(key!='n'&&key!='N') {
		if(flag)	cout << "Do you want to continue?(enter \"y\" to continue)" << endl;
		else cout << "Respond with y or n" << endl;
		cin >> key;
		if (key == 'y' ||key== 'Y') {
			example.UpDate();
			example.Print();
		}
		else flag = 0;
	}
}

//Life.h

#pragma once
#include<iostream>
using namespace std;
const int Max = 30;
class Life
{
public:
	Life() {
		for (int i = 0; i < Max + 4; i++)
			arr[i] = 0;
	};
	void Print();
	void UpDate();
	void Initialized();

private:
	int neighbour_count(int);
	int arr[Max + 4];
};



//Life.cpp


#include"Life.h"
#include<iostream>
#include<string>
using namespace std;
void Life::Initialized() {
	int k;
	cin >> k;
	while (k != -1) {
		arr[k+1] = 1;
		cin >> k;
	}
}
void Life::Print() {
	system("cls");
	for (int i =2; i <= Max+1; i++) {
		if (arr[i] == 1)cout << '*';
		else cout << '-';
	}
	cout << endl;
}
void Life::UpDate() {
	int new_arr[Max + 4];
	for (int i = 0; i < Max + 4; i++)
		new_arr[i]=0;
	for (int i = 2; i <= Max+1; i++)
	{
		// cout << neighbour_count(i)<<' ';
		switch (neighbour_count(i))
		{
		case 2:
			new_arr[i] = 1;
			break;
		case 3:
			if (arr[i] == 1) new_arr[i] = 0;
			else new_arr[i] = 1;
			break;
		default:
			new_arr[i] = 0;
		}
	}
	for (int i = 0; i < Max + 4; i++) {
		//cout << new_arr[i];
		arr[i] = new_arr[i];
	}
}
int Life::neighbour_count(int k) {
	int sum = 0;
	for (int i = k-2; i <=k+2 ; i++)
		if (arr[i] == 1)sum++;
	if (arr[k] == 1)return (sum - 1);
	else return sum;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Here is an example code for a one-dimensional convolutional wavelet neural network using PyTorch: ```python import torch import torch.nn as nn import pywt class ConvWaveletNet(nn.Module): def __init__(self, num_classes): super(ConvWaveletNet, self).__init__() self.conv1 = nn.Conv1d(1, 16, kernel_size=3, stride=1, padding=1) self.relu1 = nn.ReLU() self.pool1 = nn.MaxPool1d(kernel_size=2, stride=2) self.conv2 = nn.Conv1d(16, 32, kernel_size=3, stride=1, padding=1) self.relu2 = nn.ReLU() self.pool2 = nn.MaxPool1d(kernel_size=2, stride=2) self.conv3 = nn.Conv1d(32, 64, kernel_size=3, stride=1, padding=1) self.relu3 = nn.ReLU() self.pool3 = nn.MaxPool1d(kernel_size=2, stride=2) self.fc1 = nn.Linear(64 * 4, 128) self.relu4 = nn.ReLU() self.fc2 = nn.Linear(128, num_classes) def forward(self, x): # Apply wavelet transform to the input signal cA, cD = pywt.dwt(x, 'db1') x = cA + cD x = torch.tensor(x).unsqueeze(0).unsqueeze(0).float() # add batch and channel dimensions # Convolutional layers x = self.conv1(x) x = self.relu1(x) x = self.pool1(x) x = self.conv2(x) x = self.relu2(x) x = self.pool2(x) x = self.conv3(x) x = self.relu3(x) x = self.pool3(x) # Fully connected layers x = x.view(-1, 64 * 4) x = self.fc1(x) x = self.relu4(x) x = self.fc2(x) return x ``` This network consists of three convolutional layers followed by two fully connected layers. The input signal is first transformed using the discrete wavelet transform, and then passed through the convolutional layers. The output of the last convolutional layer is flattened and passed through the fully connected layers to produce the final classification result. Note that this implementation uses the 'db1' wavelet for the wavelet transform, but other wavelets can also be used.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值