問(wèn)題描述

數(shù)組A=['G','D','B','H'] , 元素個(gè)數(shù)不定, 元素內(nèi)容可以是任意字符

集合B=[{'id':'a',item:''},{'id':'a=b',item:''}], 數(shù)量不定, 結(jié)構(gòu)固定

現(xiàn)在要把A中的元素均分給B中的item,分到多個(gè)時(shí)用逗號(hào)分隔.

對(duì)于A的元素個(gè)數(shù)小于或大于B的長(zhǎng)度時(shí), 只要求A要全部在B里出現(xiàn)就行了, 集合B的item至少要分到一個(gè)元素, 最好均分, 但集合B里的每個(gè)item不能有重復(fù)元素

有什么方法比較簡(jiǎn)便?

問(wèn)題解答

已經(jīng)解決了

import com.google.common.collect.Lists;import com.google.common.collect.Maps;import com.google.common.collect.Sets;import org.apache.commons.collections.CollectionUtils;import org.apache.commons.lang3.RandomStringUtils;import org.apache.commons.lang3.RandomUtils;import org.apache.commons.lang3.StringUtils;import java.util.HashMap;import java.util.List;import java.util.Map;import java.util.Set;/** * Created by YSTYLE on 2017-04-17 0017. */public class TEst { private static List<String> list = Lists.newArrayList(); private static List<Map> los = Lists.newArrayList(); public static void main(String[] args) {init();List<String> augmented = list;int groupCount = los.size();if (list.size() < groupCount){ augmented = Augmented(list, groupCount);}List<List<String>> chunk = chunk2(augmented, groupCount);for (int i = 0; i < los.size(); i++) { los.get(i).put('item', StringUtils.join(chunk.get(i),',') );}System.out.println(los); } // 初始化測(cè)試數(shù)據(jù) private static void init (){int losCount = RandomUtils.nextInt(1,10);int listCount = RandomUtils.nextInt(1,10);for (int i = 0; i < listCount ; i++) { list.add(RandomStringUtils.randomAlphabetic(4));}for (int i = 0; i < losCount; i++) { Map<String,Integer> map = new HashMap<String, Integer>(); map.put('id',RandomUtils.nextInt(10000,99999)); los.add(map);}System.out.println('生成的數(shù)組: ' + list+' 數(shù)量: '+listCount);System.out.println('生成的對(duì)象數(shù)量: ' + los.size()); } // 分組數(shù)據(jù) public static <T> List<List<T>> chunk2(List<T> list, int group){if (CollectionUtils.isEmpty(list)){ return Lists.newArrayList();}List<List<T>> result = Lists.newArrayList();Map<Integer,Set<T>> temp = Maps.newHashMap();for (int i = 0; i < list.size(); i++) { if (temp.containsKey(i%group)) {Set<T> ts = temp.get(i % group);ts.add(list.get(i));temp.put(i%group,ts); }else {Set<T> ts = Sets.newHashSet();ts.add(list.get(i));temp.put(i % group,ts); }}for (Set<T> ts : temp.values()) { result.add(Lists.newArrayList(ts));}return result; } // 填充數(shù)據(jù) public static <T> List<T> Augmented(List<T> list ,int size){int length = CollectionUtils.isEmpty(list)?0:list.size();if (length<1){ return Lists.newArrayList();}List<T> result = Lists.newArrayList(list);if (length > size){ return result;}int count = size - length;for (int i = 0; i < count; i++) { result.add(list.get(RandomUtils.nextInt(0, length)));}return result; }}回答2：

1.A.length<=B.length 對(duì)A循環(huán)，直接賦值2.A.length>B.length對(duì)B循環(huán)let size = Math.floor(A.length/B.length)取整for(let i in B){數(shù)組劃分 if(i==B.lenght-1){ B[i].item = A.splice(Start) }else{ let start = 0; B[i].item = A.splice(start,start + size)) start = start + 4; }}