arithmetic java算法冒泡排序、二叉树、数组、链表、队列学习简单示例
arithmetic java算法冒泡排序、二叉树、数组、链表、队列学习简单示例private static void mpSoft(String [] data) { for (int i = 0; i < data.length - 1; i++) { System.out.println(Arrays.toString(data)); for (int j = 0; j < data.length - 1 - i; j++) { if (data[j].lastIndexOf("+") > data[j + 1].lastIndexOf("+")) { String datum = data[j]; data[j] = data[j + 1]; data[j + 1] = datum; } }
文件大小：6.06KB
评论区