开源日报 每天推荐一个 GitHub 优质开源项目和一篇精选英文科技或编程文章原文,坚持阅读《开源日报》,保持每日学习的好习惯。
今日推荐开源项目:《文字识别 tesseract.js》
今日推荐英文原文:《Do You Know How to Solve These Programming Problems?》
开源日报第648期:《文字识别 tesseract.js》
今日推荐开源项目:《文字识别 tesseract.js》传送门:GitHub链接
推荐理由:OCR——Optical Character Recognition,即光学字符识别,简单地说就是获取特定图片上的文字的过程。这个项目是纯 JS 实现的各种语言的 OCR,除了常用的中英文以外提供了相当多语言的支持以防患于未然,即使抛开不常用的语言不提,这个项目的功能依然足够日常使用,通过项目提供的各种示例可以轻松上手。
开源日报第648期:《文字识别 tesseract.js》
今日推荐英文原文:《Do You Know How to Solve These Programming Problems?》作者:Daan
原文链接:https://medium.com/better-programming/do-you-know-how-to-solve-these-programming-problems-18d04defc05e
推荐理由:一些算法小题目

Do You Know How to Solve These Programming Problems?

Can you wrap your head around all of them?

Programming is about solving problems. In this piece, I’ve listed six programming problems from several sites that contain programming problems. The problems in this listed are sorted based on how difficult they are to solve — with number one on this list being the easiest, and number six being the most difficult to solve. Can you wrap your head around all of them? I provided the solutions to these programming problems, coded in PHP, at the bottom of this article. You can choose a programming language of your choice to solve these problems. Good luck solving these problems, and happy coding! Challenges

1. Plus Minus

开源日报第648期:《文字识别 tesseract.js》 Let’s start with a relatively easy problem provided by HackerRank. This challenge is categorized as a warmup.

2. Two Sum

开源日报第648期:《文字识别 tesseract.js》 A challenge that’s considered easy, provided by LeetCode.

3. Largest palindrome product

开源日报第648期:《文字识别 tesseract.js》 This problem is provided by Project Euler and is considered one of the more easy problems. It’s currently solved by more than 455,000 people.

4. Distinct powers

开源日报第648期:《文字识别 tesseract.js》 Another challenge from Project Euler. This one is a little bit harder than the previous problem. It’s solved by around 100,000 people.

5. Kaprekars Constant

开源日报第648期:《文字识别 tesseract.js》 If you’ve made it up to this point: Congratulations! It’s time to start the first hard challenge. This challenge is provided by Coderbyte.

6. Swap Nodes in Pairs

开源日报第648期:《文字识别 tesseract.js》 Definitely the toughest challenge so far, this challenge is provided by LeetCode. Although it’s considered to be of medium difficulty, I found this one harder to solve than the Kaprekars Constant. This one requires you to know how linked lists work.

Solutions

1. Plus Minus

A really great problem to get you started with a solution that’s really straightforward.

2. Two Sum

Although this one’s a little bit harder than the first problem, you shouldn’t have too much trouble solving this one. I used a simple brute-force approach.

3. Largest palindrome product

The solution I came up with has the advantage it can be used to find the biggest palindrome that’s the product of any two x-digit numbers. I’ve also added stop conditions to avoid unnecessary extra looping.

4. Distinct powers

I solved the distinct powers problem by going the brute-force route. Add each result to the array, and then remove duplicates from the array. The last step is to sort the array.

5. Kaprekars Constant

The Kaprekars Constant problem is a little bit harder to solve. It’s the first problem in this list that requires recursion to solve the problem. 开源日报第648期:《文字识别 tesseract.js》 A screenshot of passing all test cases

6. Swap Nodes in Pairs

This one took me a while to figure out. The trick in my solution is to pass variables by reference instead of by value. Still, this one might take some time to get your head around. 开源日报第648期:《文字识别 tesseract.js》
下载开源日报APP:https://openingsource.org/2579/
加入我们:https://openingsource.org/about/join/
关注我们:https://openingsource.org/about/love/