資源簡介
動態規劃算法:從1到26分別對應a-z的每一個字母,輸入一串數字的字符串,轉換為字母,輸出所有可能的字母序列。如123->abc、lc、aw
本資源是按照二叉樹的思想解決該問題。從字符串的頭部開始,每次可以取一個或者兩個數字進行轉換,向左為取一個,向右取兩個,,,,
代碼片段和文件信息
public?class?Item?{
//指向父節點
private?Item?parent;
//該節點的字符串的值
private?String?key;
//轉義后的值
private?String?code;
//這個節點在字符串中的位置
//如1在123中index=012在123中index=1
private?int?index;
public?int?getIndex()?{
return?index;
}
public?void?setIndex(int?index)?{
this.index?=?index;
}
public?Item?getParent()?{
return?parent;
}
public?void?setParent(Item?parent)?{
this.parent?=?parent;
}
public?String?getKey()?{
System.out.println(key);
return?key;
}
public?void?setKey(String?key)?{
this.key?=?key;
}
public?String?getCode()?{
if(index?==?-1?||?!Main.map.containsKey(key)){
return?““;
}
return?Main.map.get(key);
}
public?void?setCode(String?code)?{
this.code?=?code;
}
}
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????????301??2018-05-05?00:29??guo\.classpath
?????文件????????379??2018-05-05?00:29??guo\.project
?????文件????????598??2018-05-05?00:29??guo\.settings\org.eclipse.jdt.core.prefs
?????文件???????1467??2018-05-05?01:57??guo\bin\Item.class
?????文件???????3240??2018-05-07?08:50??guo\bin\Main.class
?????文件????????800??2018-05-05?01:57??guo\src\Item.java
?????文件???????3046??2018-05-07?08:50??guo\src\Main.java
?????目錄??????????0??2018-05-07?08:51??guo\.settings
?????目錄??????????0??2018-05-07?08:51??guo\bin
?????目錄??????????0??2018-05-07?08:51??guo\src
?????目錄??????????0??2018-05-07?08:51??guo
-----------?---------??----------?-----??----
?????????????????9831????????????????????11
評論
共有 條評論