急急急急急。c++赋值语句无效，真心求教

#pragma once
#include<string.h>
#include<stdio.h>

struct Data
{
public:
	char* name;
	int num;
	char* type;
};

class ChainListNode
{
public:
	Data data;
	ChainListNode* nextNode;
};

class ChainListHeadNode
{
public:
	ChainListHeadNode()
	{
		nextNode = nullptr;
	}
	ChainListNode* nextNode;
};

class ChainList
{
public:
	ChainListHeadNode* firstNode;

	ChainList()
	{
		length = 0;
		firstNode = new ChainListHeadNode;
		firstNode->nextNode = nullptr;
	}

	~ChainList()
	{
		ChainListNode* current;
		current = firstNode->nextNode;
		while (firstNode->nextNode)
		{
			current = current->nextNode;
			delete firstNode->nextNode;
			firstNode->nextNode = current;
		}
		delete firstNode;
	}

	bool Insert(char* newName, int newNum, char* newType)
	{
		ChainListNode* newNode = new ChainListNode;
		newNode->data.name = _strdup(newName);
		newNode->data.num = newNum;
		newNode->data.type = _strdup(newType);

		newNode->nextNode = firstNode->nextNode;
		firstNode->nextNode = newNode;
		length++;

		return true;
	}

	ChainListNode* Search(char* searchKey)
	{
		ChainListNode* current = firstNode->nextNode;
		for (int i = 0; i < length; i++)
		{
			if (strcmp(searchKey, current->data.name) == 0)
				return current;
			if (current->nextNode == nullptr)
				return nullptr;
			current = current->nextNode;
		}
		return nullptr;
	}

	int getListLength()
	{
		return length;
	}

private:
	int length;
};

#define _CRT_SECURE_NO_WARNINGS；
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <string>
#include"head.h"
using namespace std;

char KEYWORD[] = "保留字";
char ID[] = "标识符";
char NUM[] = "常数";
char SEPARATOR[] = "分隔符号";
char ARITHMETIC[] = "算术运算符";
char RELATIONAL[] = "关系运算符";
char SPECIAL[] = "特殊符号";

char keyWord[200][200] = {"abstract","auto","break","case","char","class","const",
"continue","default","delete","double","enum","extern","f","F","far","final",
"float","for","friend","goto","if","inline","int","interrupt","l","L","long",
"new","operator","private","protected","public","register","return","short",
"signed","sizeof","static","struct","switch","typedef","u","U","union","unsigned",
"virtual","void","while","main","else","wchar_t"};
char entry[200] = "";
FILE* cstream, * outstream;
int sEnd[] = {2,3,4,6,7,8,11,12,14,15,17,18,20,21,23,24,26,27,29,30,32,33,35,36,37,45,47,48};
int currentNum = 0;
int numOfKeyWord = 0;
int numOfID = 0;
int numOfNum = 0;
int numOfSeparator = 0;
int numOfArithmetic = 0;
int numOfRelational = 0;
int numOfSpecial = 0;
bool ifflag = true;

ChainList keyWordLt;
ChainList keyWordList;
ChainList idList;
ChainList numList;
ChainList separatprList;
ChainList arithmeticList;
ChainList relationalList;
ChainList specialList;

int move(int s, char ch);
int getLength(char entry[]);
void AutoForLexical(FILE* cstream, FILE* outstream);
int findEnd(int s);

int main()
{

	if ((cstream = fopen("d:\\sample.txt", "r")) == NULL)
	{
		printf("Failed to open sample.txt!");
		exit(0);
	}
	if ((outstream = fopen("d:\\text1.txt", "w")) == NULL)
	{
		printf("Failed to open text1.txt");
		exit(0);
	}

	while (strcmp("", keyWord[currentNum]) != 0)
	{
		keyWordLt.Insert(keyWord[currentNum], currentNum, KEYWORD);
		currentNum++;
	}

	AutoForLexical(cstream, outstream);

	ChainListNode* temp;

	fprintf(outstream,"%s \n","标识符表");
	temp = idList.firstNode->nextNode;
	for (int i = 0; i <= idList.getListLength() - 1; i++)
	{	
		fprintf(outstream, "%d %s %s\n", temp->data.num,temp->data.name,temp->data.type);
		//printf("%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		printf("\n");
	}

	fprintf(outstream, "%s \n", "保留字");
	temp = keyWordLt.firstNode->nextNode;
	for (int i = 0; i <= keyWordLt.getListLength() - 1; i++)
	{
		fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		//printf("%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		printf("\n");
	}

	fprintf(outstream, "%s \n", "常数表");
	temp = numList.firstNode->nextNode;
	for (int i = 0; i <= numList.getListLength() - 1; i++)
	{
		fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		//printf("%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		printf("\n");
	}

	fprintf(outstream, "%s \n", "分隔符号表");
	temp = separatprList.firstNode->nextNode;
	for (int i = 0; i <= separatprList.getListLength() - 1; i++)
	{
		fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		//printf("%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		printf("\n");
	}

	fprintf(outstream, "%s \n", "算术运算符表");
	temp = arithmeticList.firstNode->nextNode;
	for (int i = 0; i <= arithmeticList.getListLength() - 1; i++)
	{
		fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		//printf("%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		printf("\n");
	}

	fprintf(outstream, "%s \n", "关系运算符表");
	temp = relationalList.firstNode->nextNode;
	for (int i = 0; i <= relationalList.getListLength() - 1; i++)
	{
		fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		//printf("%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		printf("\n");
	}

	fprintf(outstream, "%s \n", "特殊符号表");
	temp = specialList.firstNode->nextNode;
	for (int i = 0; i <= specialList.getListLength() - 1; i++)
	{
		fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		//printf("%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
		printf("\n");
	}

	fclose(cstream);
	fclose(outstream);

	system("pause");

}

void AutoForLexical(FILE* cstream, FILE* outstream)
{
	char ch;
	int s0 = 0;
	int s = s0;

	memset(entry, '\0', sizeof(entry));
	ch = fgetc(cstream);

	while (ch!=EOF)
	{
		s = move(s, ch);

		if (findEnd(s) != -1)
		{
			if (s >= 2 && s <= 18)//算术运算符
			{
				ChainListNode* temp = arithmeticList.Search(entry);
				if (temp==nullptr)
				{
					arithmeticList.Insert(entry, numOfArithmetic, ARITHMETIC);
					numOfArithmetic++;
				}
				else
				{
					fprintf(outstream,"%d %s %s\n",temp->data.num,temp->data.name,temp->data.type);
				}
			}

			else if (s==48)//特殊字符
			{
				ChainListNode* temp = specialList.Search(entry);
				if (temp == nullptr)
				{
					specialList.Insert(entry, numOfSpecial, SPECIAL);
					numOfSpecial++;
				}
				else
				{
					fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
				}
			}

			else if (s==37)//分隔符号
			{
				if ((int)ch == 126 || (int)ch == 94)
				{
					ChainListNode* temp = arithmeticList.Search(entry);
					if (temp == nullptr)
					{
						arithmeticList.Insert(entry, numOfArithmetic, ARITHMETIC);
						numOfArithmetic++;
					}
					else
					{
						fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
					}
				}
				else if ((int)ch == 34 || (int)ch == 39)
				{
					ChainListNode* temp = specialList.Search(entry);
					if (temp == nullptr)
					{
						specialList.Insert(entry, numOfSpecial, SPECIAL);
						numOfSpecial++;
					}
					else
					{
						fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
					}
				}
				else
				{
					ChainListNode* temp = separatprList.Search(entry);
					if (temp == nullptr)
					{
						separatprList.Insert(entry, numOfSeparator, SEPARATOR);
						numOfSeparator++;
					}
					else
					{
						fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
					}
				}
			}

			else if (s == 30)
			{
				ChainListNode* temp = separatprList.Search(entry);
				if (temp == nullptr)
				{
					separatprList.Insert(entry, numOfSeparator, SEPARATOR);
					numOfSeparator++;
				}
				else
				{
					fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
				}
			}

			else if (s>=20 && s<=36 && s!=30)//关系运算符
			{
				ChainListNode* temp = relationalList.Search(entry);
				if (temp == nullptr)
				{
					relationalList.Insert(entry, numOfRelational, RELATIONAL);
					numOfRelational++;
				}
				else
				{
					fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
				}
			}

			else if (s==47)//标识符和保留字
			{
				if (keyWordLt.Search(entry))
				{
					ChainListNode* temp = keyWordList.Search(entry);
					if (temp == nullptr)
					{
						keyWordList.Insert(entry, numOfKeyWord, KEYWORD);
						numOfKeyWord++;
					}
					else
					{
						fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
					}
				}
				else
				{
					ChainListNode* temp = idList.Search(entry);
					if (temp == nullptr)
					{
						idList.Insert(entry, numOfID, ID);
						numOfID++;
					}
					else
					{
						fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
					}
				}
			}

			else if (s==45)//常数
			{
				ChainListNode* temp = numList.Search(entry);
				if (temp == nullptr)
				{
					numList.Insert(entry, numOfNum, NUM);
					numOfNum++;
				}
				else
				{
					fprintf(outstream, "%d %s %s\n", temp->data.num, temp->data.name, temp->data.type);
				}
			}
			memset(entry,'\0',sizeof(entry));
			s = s0;
		}

		if (ifflag)
			ch = fgetc(cstream);
		else 
			ifflag = true;
	}
}

int move(int s, char ch)
{
	if ((int)ch == 43 && s == 0)
	{
		entry[getLength(entry)] = ch;
		return 1;
	}
	else if((int)ch == 61 && s == 1)
	{
		entry[getLength(entry)] = ch;
		return 2;
	}
	else if ((int)ch == 43 && s == 1)
	{
		entry[getLength(entry)] = ch;
		return 3;
	}
	else if (s == 1)
	{
		ifflag = false;
		return 4;
	}
	else if ((int)ch == 38 && s == 0)
	{
		entry[getLength(entry)] = ch;
		return 5;
	}
	else if ((int)ch == 61 && s == 5)
	{
		entry[getLength(entry)] = ch;
		return 6;
	}
	else if ((int)ch == 62 && s == 5)
	{
		entry[getLength(entry)] = ch;
		return 7;
	}
	else if ((int)ch == 38 && s == 5)
	{
		entry[getLength(entry)] = ch;
		return 8;
	}
	else if (s == 5)
	{
		ifflag = false;
		return 9;
	}

	else if ((int)ch == 42 && s == 0)
	{
		entry[getLength(entry)] = ch;
		return 10;
	}
	else if ((int)ch == 61 && s == 10)
	{
		entry[getLength(entry)] = ch;
		return 11;
	}
	else if (s == 10)
	{
		ifflag = false;
		return 12;
	}

	else if ((int)ch == 40 && s == 0)
	{
		entry[getLength(entry)] = ch;
		return 13;
	}
	else if ((int)ch == 61 && s == 13)
	{
		entry[getLength(entry)] = ch;
		return 14;
	}
	else if (s == 13)
	{
		ifflag = false;
		return 15;
	}

	else if ((int)ch == 37 && s == 0)
	{
		entry[getLength(entry)] = ch;
		return 16;
	}
	else if ((int)ch == 61 && s == 16)
	{
		entry[getLength(entry)] = ch;
		return 17;
	}
	else if (s == 16)
	{
		ifflag = false;
		return 18;
	}

	else if ((int)ch == 33 && s == 0)
	{
		entry[getLength(entry)] = ch;
		return 19;
	}
	else if ((int)ch == 61 && s == 19)
	{
		entry[getLength(entry)] = ch;
		return 20;
	}
	else if (s == 19)
	{
		ifflag = false;
		return 21;
	}

	else if ((int)ch == 38 && s == 0)
	{
	entry[getLength(entry)] = ch;
	return 22;
	}
	else if ((int)ch == 38 && s == 22)
	{
	entry[getLength(entry)] = ch;
	return 23;
	}
	else if (s == 22)
	{
	ifflag = false;
	return 24;
	}

	else if ((int)ch == 124 && s == 0)
	{
	entry[getLength(entry)] = ch;
	return 25;
	}
	else if ((int)ch == 124 && s == 25)
	{
	entry[getLength(entry)] = ch;
	return 26;
	}
	else if (s == 25)
	{
	ifflag = false;
	return 27;
	}

	else if ((int)ch == 61 && s == 0)
	{
	entry[getLength(entry)] = ch;
	return 28;
	}
	else if ((int)ch == 61 && s == 28)
	{
	entry[getLength(entry)] = ch;
	return 29;
	}
	else if (s == 28)
	{
	ifflag = false;
	return 30;
	}

	else if ((int)ch == 62 && s == 0)
	{
	entry[getLength(entry)] = ch;
	return 31;
	}
	else if ((int)ch == 61 && s == 31)
	{
	entry[getLength(entry)] = ch;
	return 32;
	}
	else if (s == 31)
	{
	ifflag = false;
	return 33;
	}

	else if ((int)ch == 60 && s == 0)
	{
	entry[getLength(entry)] = ch;
	return 34;
	}
	else if ((int)ch == 61 && s == 34)
	{
	entry[getLength(entry)] = ch;
	return 35;
	}
	else if (s == 34)
	{
	ifflag = false;
	return 36;
	}

	else if (((int)ch == 34 || (int)ch == 40 || (int)ch == 41 || (int)ch == 44 || (int)ch == 39 || (int)ch == 58 || (int)ch == 91 || (int)ch == 93 || (int)ch == 94 || (int)ch == 123 || (int)ch == 125 || (int)ch == 126 || (int)ch==46 || (int)ch==59 || (int)ch == 92) && s==0)
	{
	entry[getLength(entry)] = ch;
	return 37;
	}

	else if (((int)ch == 43 || (int)ch == 38) && s == 0)
	{
	entry[getLength(entry)] = ch;
	return 38;
	}
	else if (((int)ch >= 48 && (int)ch <= 57) && s == 0)
	{
	entry[getLength(entry)] = ch;
	return 39;
	}
	else if (!((int)ch >= 48 && (int)ch <= 57) && s == 38)
	{
	entry[getLength(entry) - 1] = '\0';
	ifflag = false;
	return 0;
	}
	else if (((int)ch >= 48 && (int)ch <= 57) && s == 38)
	{
	entry[getLength(entry)] = ch;
	return 39;
	}
	else if (((int)ch >= 48 && (int)ch <= 57) && s == 39)
	{
	entry[getLength(entry)] = ch;
	return 39;
	}
	else if ((int)ch == 39 && s == 39)
	{
	entry[getLength(entry)] = ch;
	return 40;
	}
	else if ((int)ch == 101 && s == 39)
	{
	entry[getLength(entry)] = ch;
	return 42;
	}
	else if (s == 39)
	{
	entry[getLength(entry)] = ch;
	return 45;
	}
	else if (((int)ch >= 48 && (int)ch <= 57) && s == 40)
	{
	entry[getLength(entry)] = ch;
	return 41;
	}
	else if (((int)ch >= 48 && (int)ch <= 57) && s == 41)
	{
	entry[getLength(entry)] = ch;
	return 41;
	}
	else if ((int)ch == 101 && s == 41)
	{
	entry[getLength(entry)] = ch;
	return 42;
	}
	else if (s == 41)
	{
	ifflag = false;
	return 45;
	}
	else if (((int)ch == 43 || (int)ch == 38) && s == 42)
	{
	entry[getLength(entry)] = ch;
	return 43;
	}
	else if (((int)ch >= 41 && (int)ch <= 57) && s == 42)
	{
	entry[getLength(entry)] = ch;
	return 44;
	}
	else if (((int)ch >= 41 && (int)ch <= 57) && s == 43)
	{
	entry[getLength(entry)] = ch;
	return 44;
	}
	else if (((int)ch >= 41 && (int)ch <= 57) && s == 44)
	{
	entry[getLength(entry)] = ch;
	return 44;
	}
	else if (s == 44)
	{
	ifflag = false;
	return 45;
	}

	else if (((int)ch == 95 || ((int)ch >= 65 && (int)ch <= 90) || ((int)ch >= 97 && (int)ch <= 122)) && s == 0)
	{
		entry[getLength(entry)] = ch;
		return 46;
	}

	else if (((int)ch == 95 || ((int)ch >= 65 && (int)ch <= 90) || ((int)ch >= 97 && (int)ch <= 122) || ((int)ch >= 48 && (int)ch <= 57)) && s == 46)
	{
		entry[getLength(entry)] = ch;
		return 46;
	}
	else if (s == 46)
	{
		ifflag = false;
		return 47;
	}
	else if (s == 0 && ((int)ch == 0 || (int)ch == 7 || (int)ch == 8 || (int)ch == 9 || (int)ch == 10 || (int)ch == 11 || (int)ch == 12 || (int)ch == 13 || (int)ch == 34 || (int)ch == 39 || (int)ch == 63 || (int)ch == 92))
	{
		entry[getLength(entry)] = ch;
		return 48;
	}

	else if (s == 0)
	{
	ifflag = false;
	return 0;
	}
}

int findEnd(int s)
{
	int low = 0;
	int high = 27;
	while (low <= high)
	{
		int mid = (low + high) / 2;
		if (s == sEnd[mid])
			return sEnd[mid];
		else
			if (s > sEnd[mid])
				low = mid + 1;
			else
				high = mid - 1;
	}
	return -1;
}

int getLength(char ch[])
{
	int length = 0;
	while (ch[length] != '\0')
		length++;
	return length;
}

这是一个进行简单词法分析的程序。本人设计一个bool型全局变量ifflag，表示是否使用当前从文件流读取的字符串ch，若ifflag值为true，则表示当前ch被使用过，下一次循环时执行ch=fgetc（cstream），否则重置ifflag的值为true。而move（）函数中if的各个分支执行ifflag=false。但是我在执行的过程中发现，程序在ifflag第一次被置false后值就不在发生改变。

用于被识别的简单程序如下：

void main()
{
   int i,j,sum;
   i=j=1;
   sum=10;
   sum=i+j;
   wchar_t wch="汉字"
   printf("%d\n",sum);
}

写回答
好问题 0 提建议
追加酬金
关注问题
分享
邀请回答
编辑收藏删除
收藏举报

2条回答默认最新

关注

码龄粉丝数原力等级 --

被采纳

被点赞

采纳率
GKatHere 2021-04-18 12:57
关注
move(...)有问题，如果你不介意可以将

else if (s == 0)

   {
// ifflag = true; 去掉
       return 0;
   }

仔细确认下，当ifflag = false时，会继续多次执行move(..),保证此时ifflag不会在move永远被修改为false

本回答被题主选为最佳回答 , 对您是否有帮助呢?

解决无用
评论打赏
分享
举报

评论

按下Enter换行，Ctrl+Enter发表内容

查看更多回答(1条)

报告相同问题？

关注问题

急急急急急。c++赋值语句无效，真心求教 c++
2021-04-15 23:44

回答 2 已采纳 move(...)有问题，如果你不介意可以将 else if (s == 0) { // ifflag = true; 去掉 return 0; }
C++语言编程急急！！！用分治策略 c++ 算法
2018-03-28 08:25

回答 2 已采纳 ``` #include void swap(int a[], int i, int j) { // 交换数组a中元素i与元素j的值 int tmp; tm
学生成绩管理系统急急急C++ c++
2016-07-08 02:47

回答 12 已采纳我有一个叫做收支管理系统，使用Qt c++写的，你可以改吧改吧，把他编程成绩管理系统，大致都一样，用户验证，数据录入，数据排序，数据查询，数据用的是本地sqlite，源码地址：http://d
奇数偶数最大C语言,求教~！c语言编程奇数偶数，急急急
2021-05-25 01:04

alvarocfc的博客满意答案cloudnb2014.06.12采纳率：54%等级：12已帮助：13167人1.#includeint main(){int f(int n);int n;printf("please input the num: ");scanf("%d",&n);if(f(n))printf("奇数!\n");elseprintf("偶数!...
C++语言编程急急！！！用分治策略 c++ 算法
2018-03-28 07:49

回答 2 已采纳 ``` 参考下面的程序，输入输出就你自己修改了，不然等于帮你做作业了。 #include #include using namespace std; int
c++期末考试题，急急急 c++ 有问必答
2021-06-15 09:03

回答 2 已采纳 #include<iostream.h> #include<conio.h> //控制台数据输入输出的函数 #include<fstream.h>//文件流 #i
C++程序设计急急急！！！ c++ 有问必答
2021-06-22 08:59

回答 2 已采纳首先得用数组将成绩装起来，然后再实现右侧功能
量化私募急招~~！！！《资深C++开发工程师》 base
2024-04-24 11:03

2301_79125431的博客虽然感觉没什么问题但还是急急急（量化私募急招~~！！！《资深C++开发工量化私募急招~~！！！《资深C++开发工程师》base北京、上海P7级及以上junior的C++开双非本，找不到工作，找什么工作有出路春招offer选择 ...
C++二维数组插入并排序急急急！！！ c++ 有问必答
2021-06-22 10:41

回答 2 已采纳二维数组插入排序可以参考一下：https://www.cnblogs.com/Mrzhang3389/p/10127398.html 修改为你自己的需求即可。如有帮助，望采纳。点击我回答右上角采
请教一下这道C++题，NOIP，急急急 c++ 有问必答
2021-05-09 14:21

回答 5 已采纳 #include <iostream> #include <string> using namespace std;
请教一下这道C++题，NOIP，急急急加急 c++ 有问必答
2021-05-09 14:23

回答 4 已采纳 #include <cstdio> #include <algorithm> #include <cstring> #include <iostream&g
C++之solmyr小品文
2019-10-06 13:00

diaoqu4574的博客 “这个我知道”，zero 显得很有自信，“C/C++ 语言中，字符串是一段连续的字符型内存单元，每个单元存放一个字符，并用＼0 作为结尾的标记。” “那么使用指针之前，我们应当 ……” “我们应当保证这个指针...
回顾|友塔游戏“开学”第一课，MiniGame培训高光剪影
2023-11-24 13:07

2301_79125431的博客收到的短信写的售后服务工程师，是被转岗还是这个岗位的另一个名字呢急急急急， offer求比较牛友也可以说下理由。华为早上打电话过来问了意向地，这是有机会华为早上打电话过来问了意向地，这是有机会吗 #牛客...
webmagic采集CSDN的Java_WebDevelop页面
2016-05-23 09:53

小扁加油的博客 , 单位排班维护界面怎么开发，急急急, 请问高手，关于xstream插件的问题, JSP中if-else-if语句多的时候，运行就会报错！, myeclipse导入web项目出错, 求助：怎么将一个有web项目目录结构的java项目部署到tomcat中...
WEB开发文档2 总结
2015-04-19 20:08

CodingTrueMan的博客急急急！！框架内的页面出现错误时，如何将框架重定向到指定的ErrorPage.aspx dropdownlist如何像树形菜单那样显示相互嵌套的repeater，被嵌套的怎么引用外边的repeater的列？下拉选项是随时间变化的？ ●●100分...
MS-SQL Server 基础类 - SQL语句
2006-03-01 22:41

脉达老黄的博客一条有关分组的SQL语句求教，在线等待【建表后数据的排序问题－－如何按insert的先后排序】如何实现下问题？？？？在线等待.....请高手赐招！对象关闭时，操作不被允许更新记录？ sql语句怎么写？在先等待 SQL...
基础
2005-11-27 21:04

vcmute的博客各位兄弟，在SDK编程中如果实现窗口分割呢？请问怎么得到一个函数的执行时间，单位毫秒！如何调试asp组件呀。用vc++调试编制的组件怎样画一个箭头？高分请教如何限制程序运行的方法？求助：通过编程DirectX抓屏-----...
java开发速成班培训课程（10）
2011-10-29 16:29

iteye_10490的博客 [url=http://www.buildapp.net/java/show.asp?id=21000]求！！高手进[/url] [url=http://www.buildapp.net/java/show.asp?id=20999]甘特...急![/url] [url=http://www.buildapp.net/java/show.asp?id=20...
[android]webview访问jsp页面，能否从jsp页面获取数据
2011-10-07 14:13

Iamarmy的博客急急急急急！在模拟器上正常运行，但在手机上出现诡异的情况 eclipse 如何生成release版得程序啊？感情软件-LargerLove.apk android怎么得到assets里文件的绝对路径 AnimationDrawable为什么只显示...
android开发每日汇总【2011-11-22】
2011-11-22 08:39

iteye_10490的博客 [url=http://www.buildapp.net/android/show.asp?id=46491]mp3放到手机上不能播放，急急急[/url] [url=http://www.buildapp.net/android/show.asp?id=46490][求助]求教关于Android上C程序中内存分配的问题[/url] ...
没有解决我的问题, 去提问

问题事件

关注

码龄粉丝数原力等级 --

被采纳

被点赞

采纳率
系统已结题 9月29日
关注

码龄粉丝数原力等级 --

被采纳

被点赞

采纳率
已采纳回答 9月21日

悬赏问题

¥15 对于这个问题的解释说明
¥200 询问：python实现大地主题正反算的程序设计，有偿
¥15 smptlib使用465端口发送邮件失败
¥200 总是报错，能帮助用python实现程序实现高斯正反算吗？有偿
¥15 对于squad数据集的基于bert模型的微调
¥15 为什么我运行这个网络会出现以下报错？CRNN神经网络
¥20 steam下载游戏占用内存
¥15 CST保存项目时失败
¥20 java在应用程序里获取不到扬声器设备
¥15 echarts动画效果的问题，请帮我添加一个动画。不要机器人回答。

急急急急急。c++赋值语句无效，真心求教

2条回答 默认 最新

问题事件

悬赏问题

2条回答默认最新