摘要： CanChen ggchen@mail.ustc.edu.cn Recently I am reviewing leetcode top100 liked problems that I have solved before and I find the most important thing i 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn Recently I am reviewing leetcode top100 liked problems that I have solved before and I find the most important thing i 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn Max Consecutive Ones II Given a binary array, find the maximum number of consecutive 1s in this array if you can flip 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn Maximum Size Subarray Sum Equals k Given an array nums and a target value k, find the maximum length of a subarray tha 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn 今天编程碰到个问题，想起了《编程之美》类似的方法，于是重新翻看这本书。只看了前面一部分，有很多感悟，来分享一下。 有的人只是投了技术支持的岗位，还是要求做很多很难编程题，然后去问面试官为什么。面试官回答，因为投这个岗位的人实在太多了，得 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn Leetcode Coding is an essential skill for research and I found this article very useful. From today on, I am going to 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn Siamese Motivation: For few-show learning problems, we can use another loss function if we do not have enough training 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn A few days ago, I wrote a post about a survey on active learning but did not finished reading. Today I am going to giv 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn Circle Loss Motivation: This paper wants to provide a unified view of two elemental learning approaches, i.e., learnin 阅读全文

摘要： CanChen ggchen@mail.ustc.edu.cn Curriculum Learning Motivation: Humans learn easy things first and then begin to learn hard knowledge. This is like th 阅读全文