c# 初入门,求问拆分数据的问题, - V2EX
V2EX = way to explore
V2EX 是一个关于分享和探索的地方
现在注册
已注册用户请  登录
guanyongxin
V2EX    微软

c# 初入门,求问拆分数据的问题,

  •  
  •   guanyongxin 2015-06-18 11:18:28 +08:00 2891 次点击
    这是一个创建于 3767 天前的主题,其中的信息可能已经有所发展或是发生改变。

    比较我现在的string数组里有2W条数据,我想每1000条一组拆出来,处理,我要怎么做呢...脑洞好闭塞啊...

    5 条回复    2015-06-18 22:45:42 +08:00
    mwylaoma
        1
    mwylaoma  
       2015-06-18 12:45:25 +08:00
    split,for循环,if == 1000,处理
    zkd8907
        2
    zkd8907  
       2015-06-18 12:51:57 +08:00
    同一楼。如果想花式一点的也可以考虑用linq2object

    var all = new string[20000];
    string[] items;

    for (var i = 0; i < 20; ++i)
    {
    items = all.Skip(i).Take(1000).ToArray();
    }
    guanyongxin
        3
    guanyongxin  
    OP
       2015-06-18 15:11:56 +08:00
    public static void SplitStr(int count,ArrayList list)
    {
    try
    {
    if (count > list.Count) { PutInHtml((string[])list.ToArray(typeof(string))); return; }
    Random r = new Random();
    int z = list.Count / count;
    ArrayList yu = new ArrayList();
    int start = list.Count;
    for (int i = 0; i < start; i++)
    {
    yu.Add(list[i]);
    list.RemoveAt(i);
    if (list.Count % count == 0) { PutInHtml((string[])yu.ToArray(typeof(string))); Thread.Sleep(r.Next(1000, 4500)); break; }
    }
    var all = (string[])list.ToArray(typeof(string));
    string[] items;
    string info = string.Empty;
    for (var i = 0; i < z; ++i)
    {
    items = all.Skip(i).Take(count).ToArray();
    PutInHtml(items);
    Thread.Sleep(r.Next(1000, 4500));
    }
    }
    catch { }
    }

    这样处理了,先把余数解决,之后可以整除的就用楼上的方法
    caoyue
        4
    caoyue  
       2015-06-18 20:37:51 +08:00
    用 Linq 大概只需要一行
    p = 1000

    Enumerable.Range(0, (list.Count()+p-1)/p).ToList().ForEach(x=>PutInHtml(a.Skip(p*x).Take(p)));
    guanyongxin
        5
    guanyongxin  
    OP
       2015-06-18 22:45:42 +08:00 via Android
    @caoyue ling不会.....
    关于     帮助文档   自助推广系统     博客     API     FAQ     Solana     1005 人在线   最高记录 6679       Select Language
    创意工作者们的社区
    World is powered by solitude
    VERSION: 3.9.8.5 24ms UTC 18:42 PVG 02:42 LAX 11:42 JFK 14:42
    Do have faith in what you're doing.
    ubao snddm index pchome yahoo rakuten mypaper meadowduck bidyahoo youbao zxmzxm asda bnvcg cvbfg dfscv mmhjk xxddc yybgb zznbn ccubao uaitu acv GXCV ET GDG YH FG BCVB FJFH CBRE CBC GDG ET54 WRWR RWER WREW WRWER RWER SDG EW SF DSFSF fbbs ubao fhd dfg ewr dg df ewwr ewwr et ruyut utut dfg fgd gdfgt etg dfgt dfgd ert4 gd fgg wr 235 wer3 we vsdf sdf gdf ert xcv sdf rwer hfd dfg cvb rwf afb dfh jgh bmn lgh rty gfds cxv xcv xcs vdas fdf fgd cv sdf tert sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf sdf shasha9178 shasha9178 shasha9178 shasha9178 shasha9178 liflif2 liflif2 liflif2 liflif2 liflif2 liblib3 liblib3 liblib3 liblib3 liblib3 zhazha444 zhazha444 zhazha444 zhazha444 zhazha444 dende5 dende denden denden2 denden21 fenfen9 fenf619 fen619 fenfe9 fe619 sdf sdf sdf sdf sdf zhazh90 zhazh0 zhaa50 zha90 zh590 zho zhoz zhozh zhozho zhozho2 lislis lls95 lili95 lils5 liss9 sdf0ty987 sdft876 sdft9876 sdf09876 sd0t9876 sdf0ty98 sdf0976 sdf0ty986 sdf0ty96 sdf0t76 sdf0876 df0ty98 sf0t876 sd0ty76 sdy76 sdf76 sdf0t76 sdf0ty9 sdf0ty98 sdf0ty987 sdf0ty98 sdf6676 sdf876 sd876 sd876 sdf6 sdf6 sdf9876 sdf0t sdf06 sdf0ty9776 sdf0ty9776 sdf0ty76 sdf8876 sdf0t sd6 sdf06 s688876 sd688 sdf86