随笔分类 -  数据结构

摘要://冒泡排序public class Demo6 { public static void main(String[] args) { int []age = {1,2,36,363,56,95,12,32,1232,3263}; for (int i = 0; i age[j]){ ... 阅读全文
posted @ 2014-11-28 23:36 wikiki 阅读(168) 评论(0) 推荐(0)
摘要:编程列出一个字符串的全字符组合情况,原始字符串中没有重复字符,例如: 原始字符串是"abc",打印得到下列所有组合情况: "a" "b" "c" "ab" "bc" "ca" "ba" "cb" "ac" "abc" "acb" "bac" "bca" "cab" "cba"im 阅读全文
posted @ 2014-10-31 22:59 wikiki 阅读(1511) 评论(0) 推荐(0)
摘要:public class Demo4 { public static void main(String[] args) { int n = 5; // 0:向右,1:向下,2:向左,3:向上 int direction = 0; // 行... 阅读全文
posted @ 2014-10-29 23:10 wikiki 阅读(588) 评论(0) 推荐(0)