++i)
为企业提供网站建设、网站设计、网站优化、全网营销推广、竞价托管、品牌运营等营销获客服务。创新互联公司拥有网络营销运营团队，以丰富的互联网营销经验助力企业精准获客，真正落地解决中小企业营销获客难题，做到“让获客更简单”。自创立至今，成功用技术实力解决了企业“网站建设、网络品牌塑造、网络营销”三大难题，同时降低了营销成本，提高了有效客户转化率，获得了众多企业客户的高度认可！
{
if(cmd[i]
}
else if(cmd == "
struct
File
{
string name;
string htmp = hint; pCur-pPre =
pF-
File(){name = "!"
while(cur ;
}
}
else if(cmd ==
".pos;
pCur = pRoot-.isDir;输入分区数;
vector)
{
cin
iomanip
pos += f; cmd[i]
pNxt;++i)
{
find = false这是我们做的; hint.Run().size(); endl;
cur =
cur- endl;"string string
File* tar =
pCur-
f;\
return tail-;pChd-\
}
Rd(tar);
if(end
== -1)
break;pNxt-
Show(pCur-pChd = tail-
beg = 0.pChd =
f.find('
tail-",f);
return 0;a'pNxt-
f;
int
main()
{
DirSystem ds;
hint += "
bool find =
false;
}
else
{
if(nm;i ++i)
{
cout
tail-.size();
File* pPre!= NULL)
cout ,f);
num，拒绝删除;pChd.size()
while(tmp-
while(true)
{
res;pNxt;
ds;
cin
a'
Md(pCur;pNxt = new File;
File* ftmp = pCur;pNxt =
pF-
else if(pF-
string hint;
}
string Uniform(string
cmd)
{
string res = cmd;\name
f;pChd = new
File;
else
break;)
{
cin
for(int i = 0.pChd =
f;
tail-pPar = pRoot;
else
{
pF-RD" nm =
Parse(cmd);pNxt;
ds;
cmd = Uniform(cmd):"!find)
{
pCur =
ftmp;pNxt-
end = tar;
int offset = 'pChd ; -
',beg),f);
f;\
}
else
{
cout
int i;isDir)
cout
.pPar = f,end - beg)).pNxt = f;
}
return res.len!=
NULL)
pF-
if(cmd == "pNxt-
public;
bool isDir;isDir
= false; name,*t;
beg = end + 1; "!= NULL)
tmp =
tmp-.push_back(tar;}
};
hint = " cmd;
end = tar;)
{
cin
A'string.erase(hint; endl; "
hint = htmp;,beg); cmd;pNxt-
Parse(string tar)
{
vector
}
else
{
File* tmp = pCur-=
'
else
cout
File* pNxt;pNxt;pPre = tail;);
}
else if(cmd
== ".isDir = true;
if(pF-)
res[i] = cmd[i] +
offset;pChd.Init(),pos;
cout .find('pNxt-= 'i ,tmp; "name ==
nm[i])
{
hint += nm[i] + ' endl; ",f);\.pos = 0;
}
}
void
Rd(File* pF)
{
if(pF == NULL)
cout
pNxt;
f;pChd;;您输入的命令本系统不识别;
find = true; nm.pPar = f!=
cmd)
tar = tar-
f.name = ch++ + string("
tail-
}
return res;(文件) "
for(int i = 0;"MF"
f!"\vectorpos = f;
endl;
while(true)
{
cout res; "z'
cout
pChd);
}
if(;
#include ,f); "该文件夹中还有其它文件;pChd- endl;
cur-
cin
File f;
int
beg;
}
}
}
private;
}
}
void Init()
{
int
num;pPre-.pNxt = f;string.len = 100;
File f;pNxt ;
while(pCur
;没有找到要转向的路径;
}
}
void Run()
{
File* pCur;
tail-
cmd;iostreampNxt;输入分区容量;
break:
vectorpPar = pCur;)
{
cin
,const File f)
{
if(pCur-
cmd;
}
};
while(tar)
{
if(tar-
MD"
Md(pCur.len.substr(beg;pNxt-len = f;
File*
pPar;
}
else if(cmd == "
}
if(;
f;pNxt.pos = 0;pChd;
pos =
0;C'
tail-
hint = pCur-
f,end;pos = len = 0;
}
pCur =
pCur-
for(i = 0; endl; ".pPre = NULL;;
int
len;
if(cur-.isDir = false; cmd; f;;!find)
break;
char ch =
')
{
cout :"pPar = NULL;';
f;DIR".pPar = f;pNxt ;}
File*
Append(File* tail;'
delete pF;pPre;;
t =
Append(t.len.end()-1).len = 100;.pChd = f;
cmd = Uniform(cmd);i
pNxt-(文件夹) "
#include '
f;
Append(pCur-;;
endl,cmd;
f;
pCur-pNxt; "!" endl;pChd = new File.name =
cmd;:4786)
#include
pCur = pRoot;pChd = pPar = pPre =
pNxt = NULL;\:
DirSystem(){pRoot = new File;
cin
using namespace
std;
class DirSystem
{
private.name = cmd;name ;\pNxt; cmd,const
File f)
{
tail-name = f;
f;
File f;
int
pos;.pPre = NULL;
Append(tmp.isDir = true;
f.pNxt = f;pChd ==
NULL)
{
pCur-pNxt-:"pRoot-pNxt = tail-
File* pChd!=
NULL)
{
if(pCur- num;!= NULL)
{
cout
1)
hint;CD"
File* cur = pF-
}
}
void Show(File*
pF)
{
if(pF == NULL)
return;isDir = f;
}
void Md(File*
pCur!"文件不存在;":
File* pRoot;
pCur = pCur-pChd-name + ".pPre =
NULL.pos = pos;pRoot-.name;
t = pRoot-、基本上满足你的要求
#pragma
warning(disable;
#include
描述栈抽象数据类型的SStack接口的声明
public interfaceSStackE //栈接口
{
boolean isEmpty(); //判断是否空栈，若空栈返回true
boolean push(E element); //元素element入栈，若操作成功返回true
E pop(); //出栈，返回当前栈顶元素，若栈空返回null
E get(); //取栈顶元素值，未出栈，若栈空返回null
}
顺序栈类具体操作方法的声明：
importdataStructure.linearList.SStack;
public classSeqStackE implements SStackE
//顺序栈类
{
private Object value[]; //存储栈的数据元素
private int top; //top为栈顶元素下标
public SeqStack(int capacity) //构造指定容量的空栈
{
this.value = newObject[Math.abs(capacity)];
this.top=-1;
}
public SeqStack() //构造默认容量的空栈
{
this(10);
}
public boolean isEmpty() //判断是否空栈，若空栈返回true
{
return this.top==-1;
}
public boolean push(E element) //元素element入栈，若操作成功返回true
{
if (element==null)
return false; //空对象（null）不能入栈
if (this.top==value.length-1) //若栈满，则扩充容量
{
Object[] temp = this.value;
this.value = newObject[temp.length*2];
for (int i=0; itemp.length;i++)
this.value[i] = temp[i];
}
this.top++;
this.value[this.top] = element;
return true;
}
public E pop() //出栈，返回当前栈顶元素，若栈空返回null
{
if (!isEmpty())
return (E)this.value[this.top--];
else
return null;
}
public E get() //取栈顶元素值，未出栈，栈顶元素未改变
{
if (!isEmpty())
return (E)this.value[this.top];
else
return null;
}
public String toString() //返回栈中各元素的字符串描述
{
String str="{";
if (this.top!=-1)
str +=this.value[this.top].toString();
for (int i=this.top-1; i=0; i--)
str += ","+this.value[i].toString();
return str+"} ";
}
实例引用public static void main(String args[])
{
SeqStackString stack = newSeqStackString(20);
System.out.print("Push: ");
char ch='a';
for(int i=0;i5;i++)
{
String str =(char)(ch+i)+"";
stack.push(str);
System.out.print(str+" ");
}
System.out.println("\n"+stack.toString());
System.out.print("Pop : ");
while(!stack.isEmpty()) //全部出栈
System.out.print(stack.pop().toString()+" ");
System.out.println();
}
public class Test {
private static int a = 1678;
public static void main(String[] args) {
String b = String.valueOf(a);
for(int i=0;ib.length();i++){
System.out.println(b.charAt(i));
}
}
}
重庆分公司
重庆分公司
