Halo

A magic place for coding

0%

Problem

You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers or other lists.

The depth of an integer is the number of lists that it is inside of. For example, the nested list [1,[2,2],[[3],2],1] has each integer’s value set to its depth. Let maxDepth be the maximum depth of any integer.

The weight of an integer is maxDepth - (the depth of the integer) + 1.

Return the sum of each integer in nestedList multiplied by its weight.

Read more »

Problem

Given an integer array nums, return all the different possible increasing subsequences of the given array with at least two elements. You may return the answer in any order.

The given array may contain duplicates, and two equal integers should also be considered a special case of increasing sequence.

Read more »

Introduction

  这里我发布一个最近上线的Web应用——ATLivingSafe。这是一个提供亚特兰大公寓安全信息的搜索网站,目标人群是学生,可以在学生选择校外公寓时提供更好的信息支持。这本来是一个课程项目,我们最后将其部署到线上环境。网站地址为:https://murmuring-peak-84054.herokuapp.com/,大家感兴趣的可以去体验并给予反馈!

Read more »

Introduction

  好久不见。上一篇博客已经是9月份了,写到一半就进入了非常忙碌的模式,没想到一忙就忙到了现在。加上之前的CI/CD流水线需要从Travis迁移,手动发布的模式实在太麻烦,所以就等到现在才恢复更新。

  人类之所以聪明是因为会利用工具,工具使人懒惰。是的,没有了CI/CD流水线,以前手动发布博客的模式实在太过繁琐,写完博客还要敲几行命令等几分钟才能发布完成,实在令人难受。今天就来和大家分享一下使用Github Actions部署CI/CD流水线,实现hexo博客的自动发布。

Read more »