Android柱状图-柱子分组
16lz
2022-03-19
import java.lang.reflect.Array;import java.util.ArrayList;import java.util.Arrays;import java.util.HashMap;import java.util.List;import java.util.Map;public class MyTestMap {static int barGroupNum;//柱子数分为奇数和偶数static int total ;//共有的组数static List<double[]>list;static int align = 2;//每组柱子间隔static int[]xPoing;public static void main(String[] args) {list = new ArrayList<double[]>();barGroupNum = 3;total = 4;xPoing = new int[total];totalData();int length = list.size();for (int i = 0; i < length; i++) {double[] d = list.get(i);System.out.println(Arrays.toString(d));}System.out.println("===============");System.out.println(Arrays.toString(xPoing));}private static void totalData() {int count = 0;if(barGroupNum%2 != 0){for(int i = 1; i <= total; i++){double[] d = new double[barGroupNum];for(int j = 1; j <= barGroupNum; j++ ){int x = (total+1)*(j-1)+i;d[j-1] = x;if(j == (barGroupNum/2+1)){xPoing[count++] = x;}}list.add(d);}}else{for(int i = 1; i <= total; i++){double[] d = new double[barGroupNum];int j = 1;for(; j <= barGroupNum/2; j++ ){d[j-1] = (barGroupNum+2)*(i-1)+j;}xPoing[count++] = (barGroupNum+2)*(i-1)+j;int a = j-1;for(j = barGroupNum/2+2; j <= barGroupNum+1; j++ ){d[a++] = (barGroupNum+2)*(i-1)+j;}list.add(d);}}}}
更多相关文章
- python利用while求100内的整数和方式
- PHP算法练习九：将全部偶数转到全部奇数之前
- 1. box-sizing属性解决了什么问题?2. 伪类选择器的参数 an+b的经
- 给定一个数组筛选其偶数成员组成新的数组返回
- 0805作业 找出数组偶数 和 计算器
- 给定一个数组$arr = [23,3,45,6,78,8,34],筛选其偶数成员组成新
- 0805作业
- 0805 PHP编程作业
- php 求数组中的偶数成员