ScutKevinYzy的博客

/**738 · 计数回文子序列算法HardAccepted Rate34%DescriptionSolutionNotesDiscussLeaderboardDescription给出一个字符串 S, 计算字符串 S 中不同非空回文子序列的数量, 返回这个数对 10^9 + 7 取模后得结果.字符串 S 的子序列可以通过删去 S 中 0 个或多个字符得到. 一个序列如果是回文的, 那么它逆序后与原序列相等.两个序列 A[1], A[2], … B[1], B[2], … 如果存在 A[

/**727 · Chinese Remainder TheoremAlgorithmsHardAccepted Rate32%DescriptionSolutionNotesDiscussLeaderboardDescriptionWe are given two arrays num[0…k-1] and rem[0…k-1]. In num[0…k-1], every pair is coprime (gcd for every pair is 1). We need to find

/**721 · 下一个稀疏数算法HardAccepted Rate38%DescriptionSolutionNotesDiscussLeaderboardDescription一个数是稀疏数如果这个数的 二进制表示 中没有相邻的 1，给出一个 n ，找出大于或等于 n 的最小的稀疏数。eg. 5 (二进制表示为 101)是稀疏数，但是 6 (二进制表示为 110 ）不是稀疏数Example样例 1:输入：6输出：8解释：6 = 110(2) 并且 8 = 1000(2)样

/**699 · Check Sum of K PrimesAlgorithmsHardAccepted Rate27%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven two numbers n and k. We need to find out if n can be written as sum of k prime numbers.n <= 10 ^ 9ExampleExample 1Input:n

/**676 · Decode Ways IIAlgorithmsHardAccepted Rate39%DescriptionSolutionNotesDiscussLeaderboardDescriptionA message containing letters from A-Z is being encoded to numbers using the following mapping way:‘A’ -> 1‘B’ -> 2…‘Z’ -> 26Beyo

/**639 · 单词缩写算法HardAccepted Rate44%DescriptionSolutionNotesDiscussLeaderboardDescription给出一组 n 个不同的非空字符串，您需要按以下规则为每个单词生成 最小 的缩写。从第一个字符开始，然后加上中间缩写掉的字符的长度，后跟最后一个字符。如果有冲突，就是多个单词共享相同的缩写，使用较长的前缀，而不是仅使用第一个字符，直到使单词的缩写的映射变为唯一。 换句话说，最终得到的缩写不能映射到多个原始单词。如果

/**633 · Find the Duplicate NumberAlgorithmsHardAccepted Rate49%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), guarantee that at least one duplic

/**600 · Smallest Rectangle Enclosing Black PixelsAlgorithmsHardAccepted Rate38%DescriptionSolutionNotesDiscussLeaderboardDescriptionAn image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are con

/**516 · Paint House IIAlgorithmsHardAccepted Rate36%DescriptionSolutionNotesDiscussLeaderboardDescriptionThere are a row of n houses, each house can be painted with one of the k colors. The cost of painting each house with a certain color is diffe

/**450 · Reverse Nodes in k-GroupAlgorithmsHardAccepted Rate40%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a mu

/**430 · Scramble StringAlgorithmsHardAccepted Rate42%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible rep

/**183 · Wood CutAlgorithmsHardAccepted Rate29%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the

/**1046 · Prime Number of Set Bits in Binary RepresentationAlgorithmsEasyAccepted Rate70%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime numbe

/**168 · Burst BalloonsAlgorithmsHardAccepted Rate51%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the

/**154 · Regular Expression MatchingAlgorithmsHardAccepted Rate31%DescriptionSolutionNotesDiscussLeaderboardDescriptionImplement regular expression matching with support for ‘.’ and ‘*’.‘.’ Matches any single character.‘*’ Matches zero or more of

/**1892 · Mine-sweepingAlgorithmsMediumAccepted Rate36%DescriptionSolutionNotesDiscussLeaderboardDescriptionIt’s an easy mine-sweeping game.You are given a n*m matrix as the map of game.Each position has a value (0 or 1, 1 means there is no thunde

/**1891 · Travel PlanAlgorithmsMediumAccepted Rate60%DescriptionSolutionNotesDiscussLeaderboardDescriptionThere are n cities, and the adjacency matrix arr represents the distance between any two cities.arr[i][j] represents the distance from city i

/**1890 · Form Minimum NumberAlgorithmsMediumAccepted Rate61%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven a pattern str containing only I and D. I for increasing and D for decreasing. Please design an algorithm to return the string th

/**1888 · Shortest Path in MatrixAlgorithmsMediumAccepted Rate44%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven the matrix of M rows and N columns, 0 represents empty space, - 1 represents obstacle, and 1 represents target points (there

/**1851 · Buy PassesAlgorithmsMediumAccepted Rate52%DescriptionSolutionNotesDiscussLeaderboardDescriptionAlex plans on visiting the museum and is at the counter to purchase passes for the same. The administrators have decided not to sell group pass

/**1833 · pen boxAlgorithmsMediumAccepted Rate50%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven you an array boxes and a target. Boxes[i] means that there are boxes[i] pens in the ith box. Subarray [i, j] is valid if sum(boxes[i] + boxe

/**1753 · Doing HomeworkAlgorithmsMediumAccepted Rate38%DescriptionSolutionNotesDiscussLeaderboardDescriptionFor n people, each of them needs to do m jobs independently.The i job takes cost[i] time. Since each person’s free time is different, the

/**1736 · Throw garbageAlgorithmsMediumAccepted Rate51%DescriptionSolutionNotesDiscussLeaderboardDescriptionThere are n garbage bags, and the weight of each garbage bag is between [1.01, 3.00] pounds.You can take up to 3.00 pounds of garbage one t

/**1511 · Mirror ReflectionAlgorithmsMediumAccepted Rate74%DescriptionSolutionNotesDiscussLeaderboardDescriptionThere is a special square room with mirrors on each of the four walls. Except for the southwest corner, there are receptors on each of t

/**1508 · Score After Flipping MatrixAlgorithmsMediumAccepted Rate89%DescriptionSolutionNotesDiscussLeaderboardDescriptionWe have a two dimensional matrix A where each value is 0 or 1.A move consists of choosing any row or column, and toggling eac

/**1499 · Reordered Power of 2AlgorithmsMediumAccepted Rate62%DescriptionSolutionNotesDiscussLeaderboardDescriptionStarting with a positive integer N, we reorder the digits in any order (including the original order) such that the leading digit is

/**1492 · Koko Eating BananasAlgorithmsMediumAccepted Rate59%DescriptionSolutionNotesDiscussLeaderboardDescriptionKoko loves to eat bananas. There are N piles of bananas, the i-th pile has piles[i] bananas. The guards have gone and will come back i

/**1477 · Car FleetAlgorithmsMediumAccepted Rate53%DescriptionSolutionNotesDiscussLeaderboardDescriptionN cars are going to the same destination along a one lane road. The destination is target miles away.Each car i has a constant speed speed[i] (

/**1457 · Search SubarrayAlgorithmsMediumAccepted Rate40%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven an array arr and a nonnegative integer k, you need to find a continuous array from this array so that the sum of this array is k. Ou

/**1448 · Card GameAlgorithmsMediumAccepted Rate34%DescriptionSolutionNotesDiscussLeaderboardDescriptionA card game that gives you the number of cards n，and two non-negative integers: totalProfit, totalCost. Then it will give you the profit value o

/**1439 · Consecutive Numbers SumAlgorithmsMediumAccepted Rate50%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven a positive integer N, how many groups of continuous positive integers satisfy that the sum of all numbers is N?1 <= N &l

/**1435 · Find And Replace in StringAlgorithmsMediumAccepted Rate63%DescriptionSolutionNotesDiscussLeaderboardDescriptionTo some string S, we will perform some replacement operations that replace groups of letters with new ones (not necessarily the

/**1433 · Image OverlapAlgorithmsMediumAccepted Rate65%DescriptionSolutionNotesDiscussLeaderboardDescriptionTwo images A and B are given, represented as binary, square matrices of the same size. (A binary matrix has only 0s and 1s as values.)We tr

/**1431 · Push DominoesAlgorithmsMediumAccepted Rate60%DescriptionSolutionNotesDiscussLeaderboardDescriptionThere are N dominoes in a line, and we place each domino vertically upright.In the beginning, we simultaneously push some of the dominoes e

/**1602 · Decoded String at IndexAlgorithmsMediumAccepted Rate56%DescriptionSolutionNotesDiscussLeaderboardDescriptionAn encoded string S is given. To find and write the decoded string to a tape, the encoded string is read one character at a time a

/**1601 · Boats to Save PeopleAlgorithmsMediumAccepted Rate61%DescriptionSolutionNotesDiscussLeaderboardDescriptionThe i-th person has weight people[i], and each boat can carry a maximum weight of limit.Each boat carries at most 2 people at the sa

/**1375 · Substring With At Least K Distinct CharactersAlgorithmsMediumAccepted Rate45%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven a string S with only lowercase characters.Return the number of substrings that contains at least k di

/**1371 · Linked List ComponentsAlgorithmsMediumAccepted Rate66%DescriptionSolutionNotesDiscussLeaderboardDescriptionWe are given head, the head node of a linked list containing unique integer values.We are also given the list G, a subset of the v

/**1357 · Path Sum IIAlgorithmsMediumAccepted Rate78%DescriptionSolutionNotesDiscussLeaderboardDescriptionGiven a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.A leaf is a node with no children.Exam

题目链接：https://www.lintcode.com/problem/rotate-image/description/*** @param matrix: a lists of integers* @return: nothing*/func rotate (matrix *[][]int) { // write your code here if (matrix == n...