![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
每日coder
文章平均质量分 62
XiaoM将故事
决定人生高度的从来都不是做事的完美程度,而是做事的速度.
展开
-
ACM
第一次记录!!!原创 2016-07-29 20:30:28 · 226 阅读 · 0 评论 -
DescendingOrder
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原创 2017-05-02 20:34:09 · 383 阅读 · 0 评论 -
Minimum Path Sum
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原创 2017-05-25 08:55:54 · 184 阅读 · 0 评论 -
Find All Numbers Disappeared in an Array
public class Solution { public List findDisappearedNumbers(int[] nums) { ArrayList list = new ArrayList<>(); int length = nums.length; if(length == 0) return list; Arrays.sort(nums原创 2017-05-15 10:19:41 · 243 阅读 · 0 评论 -
Maximum Depth of Binary Tree
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution {原创 2017-05-15 10:43:26 · 200 阅读 · 0 评论 -
Teemo Attacking
495. Teemo Attacking Add to List DescriptionHintsSubmissionsSolutions Total Accepted: 10525Total Submissions: 20224Difficulty: MediumContributors:love_Fawn原创 2017-05-22 08:53:02 · 480 阅读 · 0 评论 -
统计数字
描述 计算数字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时,那么该位出现的次数为:更高位...原创 2018-06-19 11:47:27 · 228 阅读 · 0 评论