sunshine945

括号匹配，水死了#include#include#includeusing namespace std;bool BracketMatch(string s) { int len = s.length(); char myStack[len]; int pos = 0; for(int i = 0; i < len; ++ i) { if(s[i]

数据结构二叉树类的实现//类的头文件#ifndef BINTREE_H_INCLUDED#define BINTREE_H_INCLUDED#includeusing namespace std;class BinTreeNode{private: BinTreeNode *left, *right; char c;public: BinTreeNode();

图类的实现两种存储结构的邻接矩阵和邻接链表存储的都实现了，实现了图类的大部分算法#ifndef GRAPH_H_INCLUDED#define GRAPH_H_INCLUDED#include#include#include#include#include#include#includeconst int MAX_V = 100;///图最多有一百个顶点cons

数据结构单链表的实现/*类的头文件*/#ifndef SLLIST_H#define SLLIST_Hstruct SLNode{ int data; SLNode *next;};class SLList{private: SLNode *head;public: SLList(); SLList(int &item); virtu

异常处理package JAVA实验;import java.util.*;class MyException extends Exception{}public class Sum{ public static void main(String[] args) { int a = 0, sum = 0; while(true) {

多线程，模拟卖票package JAVA实验;public class Ticket implements Runnable{ int number; public Ticket() { number = 100; } public static void main(String[] args) { Ticket applicat

简单数据库操作package JAVA实验;import java.sql.Connection;import java.sql.DriverManager;import java.sql.ResultSet;import java.sql.SQLException;import java.sql.Statement;class MyDB{ public MyDB(){

/*java GUI 设计一个计算器 实现简单的+，-， *， /计算功能package JAVA实验;import java.awt.*;import java.awt.event.*;import javax.swing.*;public class Calculater implements ActionListener{ JButton buttons[];

/*头文件*/#ifndef HUFFMAN_H_INCLUDED#define HUFFMAN_H_INCLUDED#include#include#include#include#include "windows.h"#include#include#include#define MAXN 256using namespace std;struct TreeNode