首页 > 其他分享 >根据股票code去重然后取每只股票最新的数据

根据股票code去重然后取每只股票最新的数据

时间:2022-10-26 21:03:27浏览次数:48  
标签:map code Map 股票 coverLog CoverLog 最新 getUpdateTime getStockCode

List<CoverLog> list = collect2.stream().filter(distinctByKey(CoverLog::getStockCode)).collect(Collectors.toList());


Map<String, CoverLog> collect4 = collect2.stream().collect(Collectors.toMap(CoverLog::getStockCode, Function.identity(), (l, r) -> l.getUpdateTime().before(r.getUpdateTime()) ? r : l));
Collection<CoverLog> values = collect4.values();

Map<String, CoverLog> map = new HashMap<>();
collect2.forEach(e -> {
CoverLog coverLog = map.get(e.getStockCode());
if (coverLog == null || coverLog.getUpdateTime().before(e.getUpdateTime())) {
map.put(e.getStockCode(), e);
}
});

Map<String, List<CoverLog>> collect5 = col
 Map<String, CoverLog> collect4 = collect2.stream().collect(Collectors.toMap(CoverLog::getStockCode, Function.identity(), (l, r) -> l.getUpdateTime().before(r.getUpdateTime()) ? r : l));
            Collection<CoverLog> values = collect4.values();

            Map<String, CoverLog> map = new HashMap<>();
            collect2.forEach(e -> {
                CoverLog coverLog = map.get(e.getStockCode());
                if (coverLog == null || coverLog.getUpdateTime().before(e.getUpdateTime())) {
                    map.put(e.getStockCode(), e);
                }
            });
            //根据股票code去重获取一个map ,key为code values为list集合
            Map<String, List<CoverLog>> collect5 = collect2.stream().collect(Collectors.groupingBy(CoverLog::getStockCode));

  

ct2.stream().collect(Collectors.groupingBy(CoverLog::getStockCode));

标签:map,code,Map,股票,coverLog,CoverLog,最新,getUpdateTime,getStockCode
From: https://www.cnblogs.com/ZhangZiXue/p/16830004.html

相关文章

  • Leetcode第862题:和至少为K的最短子数组(Shortest Subarray with sum at least k)
    解题思路前缀和定义前缀和\(s[0]=0\),\(s[i+1]=\displaystyle\sum\limits_{j=0}^inums[j]\)。例如\(nums=[1,2,-1,2]\),对应的前缀和数组为\(s=[0,1,3,2,4]\)。......
  • VSCode如何使用GIT
    @目录前言安装配置项GIT仓库创建源代码管理暂存提交前言说明下如何在VSCode使用GIT安装GIT的安装可以参考这里GIT介绍和使用配置项打开VSCode,点击设置项进入设置......
  • D - Div Game -- ATCODER
    D-DivGamehttps://atcoder.jp/contests/abc169/tasks/abc169_d参考:https://blog.csdn.net/justidle/article/details/106474626 思路计算n中所有质数的幂,No......
  • leetcode-728-easy
    SelfDividingNumbersAself-dividingnumberisanumberthatisdivisiblebyeverydigititcontains.Forexample,128isaself-dividingnumberbecause128......
  • leetcode-392-easy
    IsSubsequenceGiventwostringssandt,returntrueifsisasubsequenceoft,orfalseotherwise.Asubsequenceofastringisanewstringthatisformed......
  • leetcode-476-easy
    NumberComplementThecomplementofanintegeristheintegeryougetwhenyouflipallthe0'sto1'sandallthe1'sto0'sinitsbinaryrepresentation.Fo......
  • leetcode-1313-easy
    DecompressRun-lengthEncodedListWearegivenalistnumsofintegersrepresentingalistcompressedwithrun-lengthencoding.Considereachadjacentpairo......
  • leetcode-292-easy
    NimGameYouareplayingthefollowingNimGamewithyourfriend:Initially,thereisaheapofstonesonthetable.Youandyourfriendwillalternatetaking......
  • leetcode-599-easy
    MinimumIndexSumofTwoListsGiventwoarraysofstringslist1andlist2,findthecommonstringswiththeleastindexsum.Acommonstringisastringthat......
  • Codeforces Round #830 (Div. 2) A-D
    比赛链接A题解知识点:贪心,数论。先求出序列最大公约数\(d\),如果为\(1\)直接输出\(0\)。否则,尝试用最后一个数操作,\(gcd(d,n)=1\)则可以,花费为\(1\)。否则......