Algorithm
文章平均质量分 92
Heartsuit
物联网平台架构师,CSDN博客专家,阿里云专家博主,PMI认证项目管理专家(PMP),具备物联网、云原生、大数据等领域的研发经验。
展开
-
LeetCode[263] Ugly Number(Java)
Problem: Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.原创 2015-12-26 20:53:29 · 1061 阅读 · 0 评论 -
10进制与62进制互相转换
遇到将数字(Decimal)以62进制编码的问题,这里所谓62进制是指采用0~9A~Za~z等62个字符进行编码(按ASCII顺序由小到大)。Note:这里以`6位编码`为例实现(C#,其他语言类似,或许有更有效的方式),实际中可根据需要调整,不过注意其表述的数值大小范围(eg:6位编码最大值:56800235583(long))。10进制——>62进制/// <summary>/// 将数字原创 2016-10-26 20:54:07 · 12620 阅读 · 10 评论 -
LeetCode[240] Search a 2D Matrix II(动画演示)
目录目录ProblemExampleThought1Thought2Presentation总结Online Judge Search a 2D Matrix IIProblem: Write an efficient algorithm that searches for a value in an m x n matrix.This matrix has the follo原创 2016-08-20 10:52:20 · 683 阅读 · 0 评论 -
LeetCode[136] Single Number 位运算异或,HashMap(Java)
Problem: Given an array of integers, every element appears twice except for one. Find that single one.Thought1:The standard key to solve this problem is bit manipulation. As XOR will return 1 only w原创 2015-05-29 10:28:50 · 1488 阅读 · 0 评论 -
Leetcode 运行输出与本地结果不一样的解决方法(用例子说明)
Problem: Write an algorithm to determine if a number is “happy”. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of t原创 2015-05-29 11:08:24 · 11434 阅读 · 1 评论 -
基本遗传算法(SGA)的MATLAB实现
Sample Genetic Algorithm的MATLAB实现用两个测试用例,直观地阐述基本遗传算法的原理,具体原理参考:http://blog.csdn.net/begtostudy/article/details/4136492对于上述课件(讲得很透彻,适合对遗传算法的入门)中提出的一个问题进行了实现,并通过MATLAB作图直接观察到算法搜索的过程。闲言少叙,Show me the Co原创 2015-06-02 21:56:29 · 3387 阅读 · 0 评论 -
Leetcode[12-13] Roman to Integer & Integer to Roman(Java)
Roman to IntegerProblem: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.Java Solution:public class Solution { Map<Character, Intege原创 2015-06-06 11:10:00 · 636 阅读 · 0 评论 -
出自国外某牛人的一道面试题(About 42)
首先,这道题并不难,但是也不简单。ProblemWrite some code that calculates how many numbers under a million (positive integers) have digits that add up to 42.这是来自于国外某大牛的blog提到的一道面试题。作者先是在文中慨叹了人类在招聘软件开发人员时的极度无奈,接原创 2015-07-02 21:22:10 · 834 阅读 · 0 评论 -
Euclid's GCD Algorithm——MIT Open Courseware(Computability)
Euclid's GCD algorithmAn example of ancient computational thinking, a really wonderful non-obvious efficient algorithm is Euclid’s GCD algorithm.How do you reduce a fraction like 510/646 to lowest terms?原创 2015-06-27 21:10:35 · 935 阅读 · 0 评论 -
Node.js实现微信好友头像拼接(wechaty+sharp)
Github被Microsoft收购,Node也要倒过来了Deno… 最近新鲜事儿着实不少。。背景知乎上有个问题Python 里itchat 模块能实现什么有趣的东西?从中看到 wxImage 这个项目。基于Python下大名鼎鼎的itchat实现。让我想到了Node 下的Wechaty,之前曾用其做消息转发,这次随手拿来玩一玩,此处采用Node来实现好友头像拼接这...原创 2018-06-06 19:57:22 · 3402 阅读 · 7 评论