-
463. Island Perimeter
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.Grid cells are connected horizontally/vertically (not diagonally). The grid is completely surrounded by water, and there is exactly one is...…
-
459. Repeated Substring Pattern
Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed ...…
-
贪心法
有人说贪心算法是最简单的算法，原因很简单：你我其实都很贪，根本不用学就知道怎么贪。有人说贪心算法是最复杂的算法，原因也很简单：这世上会贪的人太多了，那轮到你我的份？贪心法简介：总是做出在当前看起来最好的选择。其不是从整体最优进行考虑，其所做出的选择只是某种局部选择最优。然后其虽不是解决整体最优解，但是对许多问题它能产生整体最优解。如单源最短路经问题，最小生成树问题等。参考网址： https://blog.csdn.net/effective_coder/article/details...…
-
455. Assign Cookies
Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and ea...…
-
347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements.返回第k个最常见的元素 返回元素出现个数最多的k个数Example 1:Input: nums = [1,1,1,2,2,3], k = 2Output: [1,2]Example 2:Input: nums = [1], k = 1Output: [1]Note: You may assume k is always valid, 1 ≤ ...…
-
215. Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.Example 1:Input: [3,2,1,5,6,4] and k = 2Output: 5Example 2:Input: [3,2,3,1,2,4,5,5,6] and k = 4Output: 4No...…
-
OCR系统使用
OCR_judging的系统nju-vm:5000/indexnju-vm:5000/mainOCR 单个文件判断 进入33：290端口docker, usr/local/src/universal_cnn 查看app.py的端口，看是否是已经开的端口 python app.py进行启动nju-ocr:2500 复制static到后面的那段地址OCR服务 在234服务器上 要想使用OCR系统，需要同时开启235和234的 234服务器的app.py，在路径、rem...…
-
tesseract使用
登录服务器ssh root@192.168.68.38显示出所有的容器docker container ls -a tesseract4re 就是我们所要安装的容器启动所要用的Dockerdocker exec -it 1bc8**** /bin/bash 执行bash 命令指定语言模型基础用法tesseract #解析test4.png图片，生成的文字会放入gemfield.txt文件中root@gemfield:# tesseract test4.png gemfieldTes...…
-
75. Sort Colors
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0, 1, and 2 to represent the color red, wh...…
-
447. Number of Boomerangs
Given n points in the plane that are all pairwise distinct, a “boomerang” is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tuple matters).Find the number of boomerangs. You...…
-
[C刊]Improving OCR Accuracy on Early Printed Books by Utilizing Cross Fold Training and Voting DAS 2018: 423-428
Christian Reul, Uwe Springmann, Christoph Wick, Frank Puppe:Improving OCR Accuracy on Early Printed Books by Utilizing Cross Fold Training and Voting. DAS 2018: 423-428问题备注，摘要 optical character recognition (ocr) is the process of recognizing ...…
-
448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Could you do it without extra space and in O(n) runtime...…
-
167. Two Sum II - Input array is sorted
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where index1...…
-
434. Number of Segments in a String
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.计算字符串中的段数，其中段定义为非空格字符的连续序列。Please note that the string does not contain any non-printable characters.请注意，该字符串不包含任何不可打印的字符。Exam...…
-
119. Pascal's Triangle II
Given a non-negative index k where k ≤ 33, return the k-th index row of the Pascal’s triangle.Note that the row index starts from 0.给一个非负的下标k，返回第k行的帕斯卡三角形的数值In Pascal’s triangle, each number is the sum of the two numbers directly above it.Example:...…
-
完美洗牌
矩阵相乘完美洗牌题目详情有个长度为2n的数组{a1,a2,a3,…,an,b1,b2,b3,…,bn}，希望排序后{a1,b1,a2,b2,….,an,bn}，请考虑有无时间复杂度o(n)，空间复杂度0(1)的解法。题目来源：此题是去年2013年UC的校招笔试题，看似简单，按照题目所要排序后的字符串蛮力变化即可，但若要完美的达到题目所要求的时空复杂度，则需要我们花费不小的精力。OK，请看下文详解，一步步优化。分析与解法解法一、蛮力变换题目要我们怎么变换，咱们就怎么变换。此题@陈利人也分析过...…
-
矩阵相乘
矩阵相乘题目描述请编程实现矩阵乘法，并考虑当矩阵规模较大时的优化方法。分析与解法根据wikipedia上的介绍：两个矩阵的乘法仅当第一个矩阵A的行数和另一个矩阵B的列数相等时才能定义。如A是m×n矩阵，B是n×p矩阵，它们的乘积AB是一个m×p矩阵，它的一个元素其中 1 ≤ i ≤ m, 1 ≤ j ≤ p。值得一提的是，矩阵乘法满足结合律和分配率，但并不满足交换律，如下图所示的这个例子，两个矩阵交换相乘后，结果变了。下面咱们来具体解决这个矩阵相乘的问题。解法一、暴力解法其实，通过前面的分...…
-
荷兰国旗
荷兰国旗题目描述拿破仑席卷欧洲大陆之后，代表自由，平等，博爱的竖色三色旗也风靡一时。荷兰国旗就是一面三色旗（只不过是横向的），自上而下为红白蓝三色。该问题本身是关于三色球排序和分类的，由荷兰科学家Dijkstra提出。由于问题中的三色小球有序排列后正好分为三类，Dijkstra就想象成他母国的国旗，于是问题也就被命名为荷兰旗问题（Dutch National Flag Problem）。下面是问题的正规描述： 现有n个红白蓝三种不同颜色的小球，乱序排列在一起，请通过两两交换任意两个球，使得...…
-
Attention Strategies for Multi-Source Sequence-to-Sequence Learning
Attention Strategies for Multi-Source Sequence-to-Sequence Learning Jindˇrich Libovick´y and Jindˇrich Helcl. 2017. Attentionstrategies for multi-source sequence-to-sequencelearning. In ACL. 提出了flat 和 Hierarchical attention 一、摘要 ...…
-
gitPic安装
安装 从https://github.com/zzzzbw/gitPic 下载gitPic.exe 在git中新建一个仓库，用来保存所有图片，并将其克隆到本地参考网址 https://github.com/zzzzbw/gitPic…
