Lutte_的博客

第一次记录！！！

Your task is to make a function that can take any non-negative integer as a argument and return it with it's digits in descending order. Essentially, rearrange the digits to create the highest possibl

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at

public class Solution { public List findDisappearedNumbers(int[] nums) { ArrayList list = new ArrayList<>(); int length = nums.length; if(length == 0) return list; Arrays.sort(nums

/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {

495. Teemo AttackingAdd to ListDescriptionHintsSubmissionsSolutionsTotal Accepted: 10525Total Submissions: 20224Difficulty: MediumContributors:love_Fawn

描述计算数字k在0到n中的出现的次数，k可能是0~9的一个值样例例如n = 12, k = 1, 在[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12], 我们发现1出现了5次(1, 10, 11, 12)题解要从1到ABCDE中找到k这个数字在某一位上出现了多少次有以下几种情况：当某一位的数字小于K时，那么该位出现的次数为：更高位...