- 博客(64)
- 资源 (8)
- 收藏
- 关注
RSS订阅原创 LeetCode:判断数组是否为有效的utf-8
A character in UTF8 can be from 1 to 4 bytes long,subjected to the following rules:1.For 1-byte character,the first bit is a 0,followed by its unicode code.2.For n-bytes character,the first n-bits are all one's,the n+1 bit is 0,followed byn-1 bytes wit.
2020-12-31 22:04:21
284
原创 LeetCode:判断s字符串是否为t字符串的子序列
Given a string s and a string t,check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t.t ispotentially a very long(length-=500,000)string and s is a short string(<=100).A subsequence of a string i.
2020-12-31 09:49:48
844
原创 LeetCode:求返回能 在D天内传送带上的所有包裹送达的船的最低运载能力
A conveyor belt packages that must be shipped from one port to another within D days.The i-th package on the conveyor belt has a weight of weight[i].Each day,we load theship with packages on the conveyor belt(in the order given by weights).We may not lo.
2020-12-30 22:22:59
309
原创 LeetCode:按照权重的概率取随机采样
题目描述:给定一个数组,数组每个位置的值表示该位置的权重,要求按照权重的概率去随机采样.Example 1:Input:weights=[1,3],actions=["pickIndex","pickIndex","pickIndex"]Output:[0,1,1]在这个样例中,每次选择的位置都是不确定的,但选择第0个位置的期望为1/4,选择第1个位置的期望为3/4.解题思路:可以先使用partial_sum求前缀和(即到每个位置为止前所有数字的和),这个结果对于正整数数组是单调递增的..
2020-12-30 15:32:28
1269
原创 LeetCode:求小于n的所有的质数
题目描述:给定一个数字n,求小于n的质数的个数.Example 1:Input:10Output:4其中[2,3,5,7]解题思路:这道题比较简单可以利用遍历法,判断是否为质数即可.此外,可以根据艾拉托斯特尼筛法是非常常用的,判断一个整数是否是质数的方法.并且可以在判断一个整数n的时候,同时判断所小于n的整数,因此非常适合这道题.其原理通俗易懂:从1到n遍历,假设当前遍历到m,则把所有小于n的,且是m的倍数的整数标为和数.遍历完成后,没有被标为和的数字即为质数.#include.
2020-12-30 13:07:28
1078
原创 LeetCode:字符串延长到指定长度需要最少的操作次数
Initially on a notepad only one character 'A' is presest.You can perform two operations on this notepad for each step:（1）Copy All:You can copy all the characters present on the notepad(partial copy is not allowed).（2）Paste:You can paste the characters .
2020-12-29 19:26:00
292
原创 LeetCode:判断三点是否构成回旋镖
/*A boomerang is a set of 3 points that are all distinct and not in a straight line.Given a list of three points in the plane,return whether these points are a boomerang.Example 1:Input:[[1,1],[2,3],[3,2]]Output:trueExample 2:Input:[[1,1],[2,2],[.
2020-12-29 10:05:26
214
原创 LeetCode:动态规划求最长子序列
Given two strings text1 and text2,return the length of their longest common subsequence.A subsequence of a string is a new string generated from the original string with somecharacters(can be none) deleted without changing the relative order of the rema.
2020-12-28 14:44:52
224
原创 LeetCode:求最少编辑步数将两个字符串变成相同
/*题目描述:给定两个字符串,已知可以进行删除、替换和插入任意字符串的任意字符,求最少编辑几步可以将两个字符串变得相同.Example 1:Input:word1="horse",word2="ros"Output:3在这个样例中,一种最优编辑方法是（1）horse->rorse（2）rorse->rose（3）rose->ros解题思路:可以使用动态规划算法,使用一个二维数组dp[i][j],表示将第一个字符串到位置i为止,和第二个字符串到位置j为止,最多需.
2020-12-28 10:05:43
2302
原创 LeetCode:求最少的硬币个数组成指定的金额
You are given coins of different denominations and a total amount of money amount.Write a function to compute the fewest number of coins that you need make up that amount.If that amount of money cannot be made up by any combination of the coins,return .
2020-12-26 21:10:43
992
原创 LeetCode:找出数组中个数为1的两个数字
给定一个整数数组nums,其中恰好有两个元素只出现一次,其余元素均出现两次.找出只出现一次的那两个元素.Example 1:Input:[1,2,1,3,2,5]Output:[3,5]解题思路:方法一:先排序,每次取两个,用数组存储结果,注意若出现相邻两个不等,则进行加1,进入下一次循环;方法二:用关联型容器存储,set或者map;方法三:位运算,对二进制数字进行分组,零和非零,则这两个数字就会落在这两个组里面.#include <iostream>#inclu.
2020-12-26 12:04:08
324
2
原创 LeetCode:找出出现一次的元素的加强版
Given a non-empty array of integers,every element appears three times except for one,which appears exactly once.Find that single one.Note:Your algorithm should have a linear runtime complexity.Could you implement it withoutusing extra memory?Example.
2020-12-21 22:07:13
146
原创 LeetCode:求数组中只出现一次的数字
Given a non-empty array of integers,every element appears twice except for one.Find thatsingle one.Note:Your algorithm should have a linear runtime complexity.Could you implement it without usingextra memory?Example 1:Input:[2,2,1]Output:1Exampl.
2020-12-21 11:45:46
163
原创 HTTP协议之请求转发、重定向与Cookie对象
请求转发请求转发是一种服务器的行为，当客户端请求到达之后，服务器进行转发，此时会将请求对象进行保存，地址栏中的URL不会改变，得到响应后，服务端再响应发送给客户端，从始至终只有一个请求发出。重定向重定向是一种服务器指导，客户端的行为。客户端发出第一个请求，被服务器接收处理后，服务器会进行响应，在响应的同时，服务器会给客户端一个新的地址（下次请求的地址response.sendRedirect(url)），当客户端接收响应后，会立刻、马上、自动根据服务器给的新地址发出第二个请求，服务器接收请求并作
2020-12-21 10:17:35
455
原创 LeetCode:增序矩阵中查找是否存在目标值
Write an efficient algorithm that searches for a value in an mxn matrix.This matrix has the following properties:Integers in each row are sorted in aascending from left to right.Integers in each column are sortedd in ascending from top to bottom.For e.
2020-12-20 20:11:52
240
原创 LeetCode:二维矩阵围绕字母的‘o‘转换成‘x‘
Given a 2D board containing 'x' and 'o'(the letter O),capture all regionssurrounded by 'x'.A region is captured by flipping all 'o's into 'x's in that surround region.Example:x x x xx o o xx x o xx o x xAfter running your function,the board shou.
2020-12-20 18:46:54
477
原创 MySQL事务日志-Redo与Undo
事务日志什么是事务日志？事务要保证ACID的完整性必须依靠事务日志做跟踪，每一个操作在真正写入数据到数据库之前，先写入到日志文件中，比如删除一行数据会先在日志文件中将此行标记为删除，但是数据库中的数据文件并没有发生变化。只有在（包含多个sql语句）整个事务提交后，再把整个事务中的sql语句批量同步到磁盘上的数据库文件中。在事务引擎上的每一次写操作都需要执行两遍如下过程：先写入日志文件中写入日志文件中的仅仅是操作过程，而不是操作数据本身，所以速度比写数据库文件速度要快很多。 再写入数据库文件中
2020-12-20 13:56:00
188
1
原创 leetcode:求直方图构成的矩形最大面积
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1,find the area of largest rectangle in the histogram.Above is a histogram where width of each bar is 1,given height=[2,1,5,6,2,3]The largest rectangle.
2020-12-19 21:51:35
277
1
原创 leetcode:出售股票的最佳时间
Say you have an array for which the i(th) element is the price of a given stockon day i.If you were only permitted to complete at most one transaction(i.e,buy one andsell one share of the stock),design an algorithm to find the maximum profit.Note that.
2020-12-19 12:22:40
110
2
原创 LeetCode:求最大幸福指数
You are given four integers,m,n,introvertsCount,and extrovertsCount.You have an mxn grid ,and there are two types of people: introverts and extroverts.There are introvertsCount introverts and extrovertsCount extroverts.You should decide how many people.
2020-12-19 10:49:19
264
1
原创 LeetCode:股票购买出售的最大利润
Say you have an array for which the (i)th element is the price ofa given stock on day i.Design an algorithm find the maximum profit.You may complete as many transactions as you like(i.e.,buy one andsell one share of the stock multiple times).Note:You.
2020-12-18 10:43:10
324
原创 leetcode:到达目的城市
You are given the array paths,where paths[i]=[cityAi,cityBi] means there exists a direct path going from cityAi to cityBi.Return the destination city,that is,the city without any outgoing to another city.It is guaranteed that the graph of paths forms a.
2020-12-17 20:11:34
171
原创 leetcode:求减到0的最少次数
You are given an interger array nums and an integer x.In one operation,you can either remove the leftmost or the rightmost element from the array nums and subtract its value from x.Note that this modifies the array for tuture operations.Return the mini.
2020-12-17 12:05:54
355
原创 LeetCode:判断两个字符串是否相似
Two strings are considered close if you can attain one from the other using the following operaitons:（1）Operation 1:Swap any two existing characters.For example,abcde->aecdb（2）Operation 2:Transform every occurrence of one existing character into an.
2020-12-16 22:15:26
384
原创 LeetCode:实现设计流分析
There is a stream of n (id,value) pairs arriving in an arbtrary order,where id is an integer between 1 and n and value is a string.No two pairs have the same id. Design a stream that returns the values in increasing order of their IDs by returning a ch.
2020-12-16 21:21:56
74
原创 LeetCode:判断二维平面上是否存在该单词
Given an mxn board and a word,find if the word exists in the word.The word can be constructed from letters of sequentially "adjacents" cells,where "adjacents" cells are horizontally or vertically neighboring.The samecell may not be used more than once.
2020-12-15 16:37:25
93
原创 LeetCode:实现二进制表的所有组合
A binary watch has 4 LEDs on the top which represent the hours(0-11),and the 6 LEDs on the bottom represent the minutes(0-59).Each LED represents a zero or one,with the least siganification bit on the right.For example,the above binary watch reads ".
2020-12-15 12:03:46
214
原创 LeetCode:求三角形顶点到低端的最小和
Given a triangle,find the minimum path sum from top to bottom.Each step you maymove to adjacent numbers on the row below.For example,given the following triangle.[ [2], [3,4], [6,5,7], [4,1,8,3]]The minimum path sum from top to bottom is 11.
2020-12-14 22:06:06
121
原创 LeetCode:求二叉树最大的高度
Given a binary tree,find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down tothe farthest leaf node.Note:A leaf is a node with no children.Example 1:Input:[3,9,20,null,null,15,7]Output:3解题思路.
2020-12-14 19:49:49
285
原创 LeetCode:求出所有存在的IP地址
Given a string containing only digits,restore it by returning all possible valid IP addresscombinations.Example 1:Input:"25525511135"Output:["255.255.11.135","255.255.111.35"]解题思路:IP每一段的数字范围是:0~255,不可以超过此范围,而且第一段不能为0,可以使用DFS进行搜索,深度满足4时,进行返回.GO语.
2020-12-14 13:13:50
277
原创 leetcode:统计编码的总数
A message containing letters from A-Z is being encoded tonumbers using the following mapping:'A'->1'B'->2...'Z'->26Given a non-empty string containing only digits,determine the total numberof ways to decode it.Example 1:Input:"12"Outp.
2020-12-13 20:21:52
311
原创 LeetCode:实现摇摆序列
A sequence of number is called a wiggle sequence if the differecesbetween successive numbers strictly alternative between positive and negative.The frist differece(if one exists)may be either positive ornegative.A sequence with fewer than two elements .
2020-12-13 12:01:13
112
原创 LeetCode:实现格雷编码
The gray code is a binary numeral system where twosuccessive values differ in only one bit.Given anon=negative integer n representing the total numberof bits in the code,print the sequence of gray code.A gray code sequence must begin with 0.Example .
2020-12-12 23:04:08
173
原创 LeetCode:求全由1构成的最大正方形面积
给定一个二维的0-1矩阵,求全由1构成的最大正方形面积.Input:[['1','0','1','0','0'], ['1','0','1','1','1'], ['1','1','1','1','1'], ['1','0','0','1','0']]Output:4解题思路:对于在矩阵内搜索正方形或长方形的题型,一种常见的做法是定义一个二维dp数组,其中dp[i][j]表示满足题目条件的,以(i,j)为右下角的正方形或者长方形的属性.对于本题,则.
2020-12-12 13:08:50
713
原创 LeetCode:寻找丢失的数字
给定一个包含[0,n]中n个数的数组nums,找出[0,n]这个范围内没有出现在数组中的那个数字.示例 1:Input:nums=[3,0,1]Output:2示例 2:Input:nums=[0,1]Output:2因为有2个数字,所有数字都在[0,2]之间内.示例 3:Input:nums=[9,6,4,2,3,1,5,7]Output:8解题思路:方法1利用等差数列求和公式求出总和,然后与数组的总和做差.方法2位运算通过异或进行,a^a=0,a^0=a.
2020-12-11 19:43:03
362
原创 leetcode:n对括号的组合
Given n pairs of parentheses,write a function to generateare all combinations of well-formed parentheses.Example 1:Input:n=3Output:["((()))","(()())","(())()","()(())","()()()"]解题思路:这道题利用深度优先搜索即可,不需要判断括号是否匹配.只需要保证左括号的个数不能小于右括号的.Go语言实现packag.
2020-12-11 15:19:29
183
原创 LeetCode:实现链表的合并
Merge two sorted linked lists and return it as a new list.The new list should be made by splicing together the nodesof the first two list.Example 1:Input:1->2->4,1->3->4Output:1->1->2->3->4解题思路:这道题比较简单,按照题意就可以.可以使用containe.
2020-12-11 12:59:32
131
原创 leetcode:判断给定的字符串括号是否有效
Given a string containing just the characters'(',')','{','}','['and']',determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets.Open brackets must be closed by in the correct order..
2020-12-10 19:43:36
285
1
原创 LeetCode:删除倒数第n个节点
给定一个链表,删除倒数第n个节点.Input:1->2->3->4->5,n=2Output:1->2->3->5解题思路:这道题相对比较简单,先循环一次拿到链表的总长度,然后循环到要删除的节点的前一个节点开始开始删除操作.有一点值得注意的是,删除的节点可能是头节点,要单独处理.还有一个较为简单的方法,设置两个指针,一个指针距离前一个指针n个距离,同时移动2个指针,当一个指针移动了终点时,那么前一个指针就是倒数第n个节点了.Go语言实现.
2020-12-10 18:30:16
116
原创 深入理解操作系统之页面置换算法
1.最佳(Optimal)置换算法1.1算法原理其选择淘汰的页面将是以后永不使用的,或许是在最长时间内不再被访问的页面.采用最佳置换算法通常可以保证获得最低的缺页率.但由于人们目前还无法预知,一个进程在内存的若干个界面中,哪一个页面是未来最长时间内不再被访问的,因而该算法是无法实现的,但可以利用它来评价其他算法.例如:假定系统为某进程分配了三个物理块,并考虑有以下页面号引用串:7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1进程在运行...
2020-12-10 13:12:39
1412
matlab MSR图像增强技术实现
2024-02-24
matlab芯片缺陷检测识别
2024-02-24
基于matlab疲劳驾驶检测
2024-02-24
基于多尺度增强图像处理系统设计，matlab
2024-02-24
基于matlab yolov3识别系统的设计，可完成火灾高精度识别
2024-02-24
基于matlab路标路况识别系统的设计
2024-02-24
基于matlab 一维cnn识别系统设计
2024-02-24
基于matlab智能数字信号处理系统设计
2024-02-24
基于matalab 人体姿态识别系统设计
2024-02-24
基于matlab斑马线识别系统设计
2024-02-24
基于matlab智能校园导航系统设计
2024-02-24
基于matlab 疲劳驾驶检测算法
2024-02-24
matlab cnn 卷积神经网络叶片病害识别
2024-02-24
基于resnet网络垃圾分类识别系统的matlab设计
2024-02-24
基于matlab深度目标检测识别系统设计
2024-02-24
matlab暗通道先验、Retinex算法实现
2024-02-24
基于matlab语音识别的信号灯系统设计
2024-02-24
基于matlab智能指纹识别系统设计
2024-02-24
基于matlab 指静脉识别系统设计
2024-02-24
matlab图像分割融合算法实现
2024-02-24
matab交通标志识别系统
2024-02-24
matlab果蔬智能识别系统
2024-02-24
智能啤酒瓶缺陷检测，matlab实现
2024-02-24
智能指纹识别系统matlab，传统图像处理算法
2024-02-24
基于神经网络cnn智能识别系统，matlab实现
2024-02-24
基于边缘特征与形状特性检索，matlab实现
2024-02-24
基于颜色与形状特征的图像检索系统，matlab实现
2024-02-24
matlab智能水果分级系统识别
2024-02-24
matlab滤镜可视化技术实现
2024-02-24
matlab图像光照增强技术
2024-02-24
matlab卷积神经网络cnn数字识别
2024-02-24
基于matalb水果成熟度识别-香蕉等
2024-02-24
matlab智能卷积神经网络垃圾分类识别
2024-02-24
matlab智能遥感图像识别
2024-02-24
matlab智能风场运行模拟计算
2024-02-24
Matlab复杂路况车牌识别系统GUI
2024-02-24
matlab智能裂缝处理系统GUI
2024-02-24
matlab瓶盖智能识别，可完成瓶盖缺陷识别
2024-02-24
matlab卷积神经网络 cnn交通标志识别
2024-02-24
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人