qq_40772639的博客

第一步，实现栈和队列#ifndef EXPRIMENT_7_CONTAINER_H#define EXPRIMENT_7_CONTAINER_H#pragma once#include <stdexcept>#include <memory>namespace Lijinbao{ template<typename T> class list { struct node { T da.

MainWindow.xaml.csusing System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks;using System.Windows;using System.Windows.Controls;using System.Windows.Data;using System.Windows.Documents;using Sys

具体讲解#include <iostream>#include <vector>using namespace std;struct Triple { Triple() { } int i = 1; int j = 1; int e = 1 ; Triple(int i, int j, int e) { this->i = i; this->j = j; this

C++#include <iostream>#include <cstring>int kmp(const char* T, const char* P);int* buildNext(const char* p);int main() { std::cout << KMP("abcaabca", "bca");}//构造next表int* buildNext(const char* p) { int* N = new int[strl

Fibonacci查找是二分查找的一个变体。原本的二分查找是取中间一个元素进行比较，而Fibonacci查找是找黄金分割点处的元素进行比较。为什么是黄金分割点处的呢，我们可以先写出一段Fibonacci数列看看：f1=1,f2=1,f3=2,f4=3,f5=5,f6=8,f7=13,f8=21f_1=1,f_2=1,f_3=2,f_4=3,f_5=5,f_6=8,f_7=13,f_8=21f1​=1,f2​=1,f3​=2,f4​=3,f5​=5,f6​=8,f7​=13,f8​=21可以发现前一项