-
746. Min Cost Climbing Stairs.md
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step...…
-
303. Range Sum Query - Immutable
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.Example 1:Input: [1,4,3,2]Output: 4Explanati...…
-
303. Range Sum Query - Immutable
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.给定整数数组nums，找到索引i和j（i≤j）之间的元素之和。Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRange(0, 5) -> -3例：给定n...…
-
python元组
词典初始化元组排序#!/usr/bin/env python# _*_ coding:utf-8 _*_li = [("nihao", 0), ("4", 9), ("3", 4)]res = sorted(li, key=lambda x: (x[1], x[0]))# li.sort()print(res) 运行结果[('nihao', 0), ('3', 4), ('4', 9)] 参考 https://blog.csdn.net/qq_24076135/artic...…
-
寻找丑数
题目描述把只包含因子2、3和5的数称作丑数（Ugly Number）。例如6、8都是丑数，但14不是，因为它包含因子7。 习惯上我们把1当做是第一个丑数。求按从小到大的顺序的第N个丑数。输入描述:整数N输出描述:第N个丑数示例1输入复制6输出复制6思路： 给定的数 ，除以2， 3，或者5，任意，看是否能够最终整除 此方法行不通 网上思路：链接：https://www.nowcoder.com/questionTerminal/cff52ae345a24...…
-
521. Longest Uncommon Subsequence I
Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be any sub...…
-
重建二叉树
题目描述输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。python实践#!/usr/bin/env python# _*_ coding:utf-8 _*_class TreeNode: def __init__(self, x): self.val = x self....…
-
机器学习基础
常见算法回归算法聚类算法正则化方法决策树学习贝叶斯方法基于核的算法聚类算法关联规则学习人工神经网络深度学习降低维度集成学习监督学习、非监督学习、半监督学习、弱监督学习监督学习 应用场景：分类问题， 回归问题 常见监督学习 支持向量机 朴素贝叶斯 逻辑回归 K近邻 决策树 随机森林 AdaBoost 线性判别分析 大多数深度学习 非监督学习 应用场景：关联规则的学习， 聚类 常...…
-
数字字符
数字字符链接：https://www.nowcoder.com/questionTerminal/024c3b99edc34b84999c5830f748a841来源：牛客网在十进制表示中，任意一个正整数都可以用字符’0’-‘9’表示出来。但是当’0’-‘9’这些字符每种字符的数量有限时，可能有些正整数就无法表示出来了。比如你有两个‘1’，一个‘2’，那么你能表示出11，12，121等等，但是无法表示出10，122，200等数。 现在你手上拥有一些字符，它们都是’0’-‘9’的字符。你可...…
-
标题分类_OCR
内容： 使用刘宇翔切分出来的标题块， 使用之前的OCR方法进行识别 初步识别类别包括 宣判笔录：1260 民事调解书：977 申请书：990 判决书：890 民事裁定书： 958 思路方法： 进入290的服务器 ssh -p 290 root@192.168.68.33 在/usr/local/src/cnn_universial 下启动服务python app.py(观察是否需要改动端口，这里的...…
-
Data_Science
业界应用概率题和统计题…
-
409. Longest Palindrome.md
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example "Aa" is not considered a palindrome here.给定一个由小写或大写字母组成的字符串，找到可以用这...…
-
378. Kth Smallest Element in a Sorted Matrix
Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.Note that it is the kth smallest element in the sorted order, not the kth distinct element.给定n×n矩阵，其中每个行和列按升序排序，找到矩阵...…
-
232. Implement Queue using Stacks
Implement the following operations of a queue using stacks. push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front element. empty() – Return whether the queue is empty.Example:...…
-
1. Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same element twice.Example:Given nums = [2, 7, 11, 15]...…
-
160. Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:编写程序以找到两个单链表开头的节点。例如，以下两个链表：开始在节点c1处相交。begin to intersect at node c1.Example 1:Input: intersectVal = 8, listA ...…
-
241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.给定一系列数字和运算符，通过计算所有不同的组编号和运算符的方式返回所有可能的结果。 有效的运算符是+， - 和*。Example...…
-
69. Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x, where x is guaranteed to be a non-negative integer.Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.计算并返回x的...…
-
[C刊]Web Knowledge Base Improved OCR Correction for Chinese Business Cards
Xiaoping Wang, Yanghua Xiao, Wei Wang:Web Knowledge Base Improved OCR Correction for Chinese Business Cards. WAIM 2015: 573-576 【C会】问题备注，摘要 knowledge base was applied to ocr correcting system from the perspective of linked knowledge. 从关联知识...…
-
309. Best Time to Buy and Sell Stock with Cooldow
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times) w...…
