Imisky

簡易leetcode79 ProblemGiven an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. Example 1: !https://assets.leetcode.com/uploads/2020/11/07/search1.jpg 123Input: board = [["o","a","a","n"],["e","t",&quo ...

hexo部落格配置adsense1. 申請adsensehttps://www.google.com/adsense/start/ 就照著申請帳號吧 2. ads.txt回到hexo在source底下新增ads.txt 1google.com, pub-xxxxxxxxxxxxxxxx, DIRECT, f08c47fec0942fa0 架設在github.io上的網站設置自己的域名1. 設定custome domain(假設已經有github.io的repo) 到github的setting/Pages 找到custom domain，並輸入自己的網域 2. hexo設定CNAME在source底下新增CNAME 1yourdomain.com 3. 設定DNS到自己的買網域的地方，設定DNS 可以參考官方文檔 https://docs.github.com/en/pages/configuring-a-custom-domain-for-your-github-pages-site/managing-a-custom-domain-for-your-git ...

ProblemGiven a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime complexity. Example 1: 123Input: nums = [1,3,5,6], target = 5Output: 2 Example 2: 123Input: nums = [1,3,5,6], target = 2Output: 1 Example 3: 123Input: nums = [1,3,5,6], target = 7Output: 4 Constraints: 1 <= nums.length <= 10^4 10^4 <= nums[i] <= 10^4 ...

ProblemGiven the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. Example 1: !https://assets.leetcode.com/uploads/2020/12/20/ex1.jpg 123Input: p = [1,2,3], q = [1,2,3]Output: true Example 2: !https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg 123Input: p = [1,2], q = [1,null,2]Output: false Example 3: !https://assets.leetcode.com/upload ...

123456789101112- [Leetcode]- [Python]- [medium]- [💡]- Math- Dynamic Programming- Combinatoricscover: /img/cover/leetcode.jpgcategories: Leetcode ProblemThere is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time. Given the two integers m and n, return the number of possible unique paths that the robot c ...

leetcode62 ProblemGiven a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row. Example 1: 123456789Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]Output: 11Explanation: The triangle looks like: 2 3 4 6 5 74 1 8 3The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above). Exa ...

可以先看看leetcode70 ProblemYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night. Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without ...

ProblemYou are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: 123456Input: n = 2Output: 2Explanation: There are two ways to climb to the top.1. 1 step + 1 step2. 2 steps Example 2: 1234567Input: n = 3Output: 3Explanation: There are three ways to climb to the top.1. 1 step + 1 step + 1 step2. 1 step + 2 steps3. 2 steps + 1 step Constraints: 1 <= n <= 45 Solve用一般的**fibona ...

ProblemDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the value of the key if the key exists, otherwise return 1. void put(int key, int value) Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recent ...

ProblemWe can scramble a string s to get a string t using the following algorithm: If the length of the string is 1, stop. If the length of the string is > 1, do the following: Split the string into two non-empty substrings at a random index, i.e., if the string is s, divide it to x and y where s = x + y. Randomly decide to swap the two substrings or to keep them in the same order. i.e., after this step, s may become s = x + y or s = y + x. Apply step 1 recursively on each of the two substri ...