Keep Learning

摘要： package LeetCode_1356 import java.util.* /** * 1356. Sort Integers by The Number of 1 Bits * https://leetcode.com/problems/sort-integers-by-the-number 阅读全文

摘要： package LeetCode_190 /** * 190. Reverse Bits * https://leetcode.com/problems/reverse-bits/description/ * Reverse bits of a given 32 bits unsigned inte 阅读全文

摘要： /** * 3. Longest Substring Without Repeating Characters * https://leetcode.com/problems/longest-substring-without-repeating-characters/description/ * 阅读全文

摘要： /** * 989. Add to Array-Form of Integer * https://leetcode.com/problems/add-to-array-form-of-integer/description/ * For a non-negative integer X, the 阅读全文

摘要： /** * 896. Monotonic Array * https://leetcode.com/problems/monotonic-array/description/ * */ class Solution { fun isMonotonic(A: IntArray): Boolean { 阅读全文

摘要： package LeetCode_253 import LeetCode_252.Interval import java.util.Arrays /** * 253. Meeting Rooms II * (Lock by Leetcode) * https://www.lintcode.com/ 阅读全文

摘要： /** * 461. Hamming Distance * https://leetcode.com/problems/hamming-distance/description/ * The Hamming distance between two integers is the number of 阅读全文

摘要： import java.util.Arrays /** * 252. Meeting Rooms * (Locked by Leetcode) * https://www.lintcode.com/problem/meeting-rooms/description * Given an array 阅读全文

摘要： import kotlin.collections.HashMap /** * 146. LRU Cache * https://leetcode.com/problems/lru-cache/description/ * * 我们需要设计： * 1：使用HashMap：用于存储现有的key,val 阅读全文

摘要： 什么是回溯？ 回溯是一种基本的搜索算法，通过在搜索过程中寻找问题的解，当发现已不满足求解条件时，就"回溯"返回，尝试别的路经。在探索过程中，当探索到某一步时，发现原先搜索并不优或达不到目标，就退回一步重新选择，这种走不通就退回再走的技术为回溯法，而满足回溯条件的某个状态的点称为“回溯点”。 搜索方式 阅读全文