zoukankan      html  css  js  c++  java
  • Java List 如何传值

    1. // 合并 List 中的相同数据行  
    2. // Source : tmpOrderEntryListBeanList  
    3. // Target : resultOrderEntryListBeanList  
    4. // ------------------------------------------------------------------  
    5.   
    6. // (1)将结果赋给 Result Livon 2010-5-18 三  
    7. // 整理列表,以便查询库存。  
    8. private List<OrderEntryListBean> setOrderEntryList(List<OrderEntryListBean> orderEntryListBeanList){  
    9.       
    10.     // (1)将结果赋给 Result Livon 2010-5-18 三  
    11.     //List<OrderEntryListBean> resultList = orderEntryListBeanList;  
    12.     ArrayList<OrderEntryListBean> list = new  ArrayList<OrderEntryListBean>(orderEntryListBeanList);  
    13.     ArrayList<OrderEntryListBean> resultList = (ArrayList<OrderEntryListBean>) list.clone();  
    14.   
    15.       
    16.     int rdcID_i, rdcID_j ;  
    17.     int itemID_i, itemID_j ;  
    18.     double itemAmount_i, itemAmount_j = 0;  
    19.   
    20.     // (2)从最后一行向上循环,直到第2条(如果存在的话)  
    21.     for(int i = resultList.size() - 1; i > 0; i--){  
    22.           
    23.         rdcID_i  = Integer.valueOf(resultList.get(i).getRdcId());  
    24.         itemID_i = Integer.valueOf(resultList.get(i).getItemId());  
    25.         itemAmount_i = Double.valueOf(resultList.get(i).getAmount());  
    26.               
    27.         // (3)从第一条,向下,直到外循环的倒数第2条。  
    28.         for(int j = 0; j < i ; j++){  
    29.               
    30.             rdcID_j  = Integer.valueOf(resultList.get(j).getRdcId());  
    31.             itemID_j = Integer.valueOf(resultList.get(j).getItemId());  
    32.             itemAmount_j = Double.valueOf(resultList.get(j).getAmount());  
    33.               
    34.             if(rdcID_i == rdcID_j && itemID_i == itemID_j ){  
    35.                 resultList.get(j).setAmount( String.valueOf(itemAmount_i  + itemAmount_j));  
    36.                 resultList.remove(i);  
    37.                 break;  
    38.             }  
    39.         }  
    40.           
    41.     }  
    42.     return resultList;  
    43.       
    44. }  
  • 相关阅读:
    < java.util >-- Set接口
    Codeforces 627 A. XOR Equation (数学)
    Codeforces 161 B. Discounts (贪心)
    Codeforces 161 D. Distance in Tree (树dp)
    HDU 5534 Partial Tree (完全背包变形)
    HDU 5927 Auxiliary Set (dfs)
    Codeforces 27E. Number With The Given Amount Of Divisors (暴力)
    lght oj 1257
    Codeforces 219D. Choosing Capital for Treeland (树dp)
    Codeforces 479E. Riding in a Lift (dp + 前缀和优化)
  • 原文地址:https://www.cnblogs.com/wxmdevelop/p/5238092.html
Copyright © 2011-2022 走看看