Apriori 演算法-如何進行關聯規則挖掘
阿新 • • 發佈:2020-12-10
StringBuilder轉化為String
String str = "abcdefghijklmnopqrs";
StringBuilder stb = new StringBuilder(str);
整型陣列轉化為字串
StringBuilder s = new StringBuilder(); for(i=1;i<=n;i++) { s.append(String.valueOf(a[i])); } String str = ""+s;
字串轉化為整形陣列
String str="123456";
int[] a = new int[str.length()];
for(int i=0;i<str.length();i++) {
a[i] = str.charAt(i)-'0';
}
字串轉化為字元陣列
String str="123456";
char[] c = str.toCharArray() ;
System.out.println(c);
字元陣列轉化為字串
char[] c = {'a','s','d','4','5',}; String str = new String(c); System.out.println(str);
字元陣列轉化為整型陣列
char[] c = { '1', '2', '3', '4', '5', };
int[] a = new int[c.length];
for (int i = 0; i < 5; i++) {
a[i] = c[i] - '0';
System.out.println(a[i]);
}
整型陣列轉化為字元陣列
[](javascript:void(0)