![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Language
qqandpinecone
这是一个个人简介。
展开
-
中间代码生成-四元式
代码:import tkinter as tkroot = tk.Tk()root.geometry("800x600+50+50")root.title("中间代码生成")label2 = tk.Label(root, text = "请输入赋值语句:")label2.place(x=10,y=10)label3 = tk.Label(root, text = "四元式序...原创 2018-12-29 14:46:09 · 7556 阅读 · 1 评论 -
最小覆盖字串 C++
代码:#include<iostream> #include<string>using namespace std;class Solution {public: string minWindow(string S, string T) { if (T.size() > S.size()) return ""; s...转载 2018-12-15 10:11:10 · 422 阅读 · 0 评论 -
C-杨辉三角
代码:#include<stdio.h>int main(){ int **p,row,i,j; printf("请输入行数:\n"); scanf("%d",&row); p = (int**)malloc(row*sizeof(int*)); if(p!=NULL){ for(i=0;i<row;i++) { p[i] = ...原创 2018-12-15 10:26:14 · 136 阅读 · 0 评论 -
二叉树图形显示
代码:#include<stdio.h>#include<stdlib.h>#include<math.h>#define MAXROW 100#define MAXCOL 100 typedef struct bitnode{ char data; struct bitnode *left,*right;}bitnode,*bitree...原创 2018-12-15 11:04:07 · 1947 阅读 · 4 评论 -
二叉树-叶子节点的个数 C
代码:#include<stdio.h>#include<stdlib.h>typedef struct bitnode{ char data; struct bitnode *lchild,*rchild;}bitnode,*bitree;bitree create(bitree t){ char ch; scanf("%c",&ch);...原创 2018-12-15 11:11:19 · 873 阅读 · 0 评论 -
二叉排序树的创建与查询 C
代码:#include<stdio.h>#include<stdlib.h>typedef int KeyType; typedef struct Node{ KeyType data; struct Node *Lchild,*Rchild;}BTNode,*BTree;void InsertBT(BTree *bt,KeyType k)...转载 2018-12-15 11:20:58 · 185 阅读 · 0 评论 -
先序中序-得后序
代码:#include<stdio.h> #include<stdlib.h>#include<string.h>#define N 100typedef struct bitnode{ char data; struct bitnode *lchild,*rchild;}bitnode,*bitree;bitnode* createpr...转载 2018-12-15 11:24:56 · 180 阅读 · 0 评论 -
统计文章单词个数-java
代码:package test1;import java.io.FileReader;import java.io.IOException;class Word{ String value; int count; Word next; public Word(String s,int count) { this.value = s; this.count = cou...转载 2018-12-15 11:38:45 · 854 阅读 · 0 评论 -
二分法排序
代码:package test;import java.util.Scanner;public class 二分排序{ public static void main(String[] args){ Scanner in = new Scanner(System.in); System.out.print("Please input the count of numbers...转载 2018-12-15 12:13:30 · 610 阅读 · 0 评论 -
塔的最短路径
代码:#include <iostream>#include<string.h>using namespace std;int num[100][100],dp[100][100];int min(int a, int b){return a<b?a:b;}int main(){ int n,i,j; ...转载 2018-12-15 10:06:29 · 243 阅读 · 0 评论