修复搜狗热搜因没有热度值导致的相应更新错误

src/main/java/com/zhiwei/searchhotcrawler/dao/HotSearchCacheDAO.java

@@ -59,8 +59,8 @@ public class HotSearchCacheDAO  {
        try {
            String name = document.getString("name");
            String type = document.getString("type");
-           int lastRank = document.getInteger("rank")!=null?document.getInteger("rank"): -1;
-           int lastCount = document.getInteger("count")!=null?document.getInteger("count"): -1;
+           Integer lastRank = document.getInteger("rank")!=null?document.getInteger("rank"): null;
+           Integer lastCount = document.getInteger("count")!=null?document.getInteger("count"): null;
            Date startTime = document.getDate("time");
            Date endTime = getEndTime(type, startTime);
            String topicLead = document.getString("topic_lead")!=null?document.getString("topic_lead"):null;
@@ -70,17 +70,17 @@ public class HotSearchCacheDAO  {
            Document query = new Document("_id", id);
            Document nowDoc = (Document) collection.find(query).first();
            if (Objects.nonNull(nowDoc)) {
-               int highestRank = nowDoc.getInteger("highestRank");
-               int highestCount = nowDoc.getInteger("highestCount");
-               int preRank = nowDoc.getInteger("lastRank");
-               int preCount = nowDoc.getInteger("lastCount");
+               Integer highestRank = nowDoc.getInteger("highestRank");
+               Integer highestCount = nowDoc.getInteger("highestCount");
+               Integer preRank = nowDoc.getInteger("lastRank");
+               Integer preCount = nowDoc.getInteger("lastCount");
 
                //判断最大热度值
-               if (lastCount > highestCount) {
+               if (Objects.nonNull(lastCount) && Objects.nonNull(highestCount) && lastCount > highestCount) {
                    highestCount = lastCount;
                }
                //判断最高排名
-               if (highestRank<0){
+               if (Objects.nonNull(lastRank) && highestRank<0){
                    highestRank = lastRank;
                }
                if (lastRank>0 && highestRank>0 && lastRank < highestRank) {