ACM之旅
本栏目汇集各大学(HDOJ、UVA、POJ、ZOJ等)、力扣的ACM题和比赛题目!
练基本功,练思维。
谙忆
Java相关研发架构工作经验5年。拥有Java相关发明专利8余项。从事过支付行业,研发与架构的系统稳定地支撑着公司日千万交易笔数量级的支付和对账。
二手车SaaS内核研发3年经验+,拥有二手车行业SaaS相关发明专利6项,研发、架构的元数据内核与权限系统,每日亿万级接口调用。
Java企业开发丰富的理论知识和实战经验。2020年CSDN博客之星第12名,同时在一些社区担任名誉职位。认证为CSDN博客专家、CSDN专栏签约作者、InfoQ签约作者、阿里云ACE杭州同城会会长、阿里云社区认证专家、华为云·云享专家。
展开
-
【阿里云在线编程】34.矩阵最小路径和
原文地址:https://copyfuture.com/blogs-details/20200227204619876tekz555paz1j0iq【阿里云在线编程】34.矩阵最小路径和题目名称矩阵最小路径和题目地址https://developer.aliyun.com/coding/34题目描述概述:给定一个矩阵,大小为m,从左上角开始每次只能向右走或者向下走,最后达到右下角...原创 2020-02-27 20:47:48 · 1371 阅读 · 1 评论 -
【题目】买卖股票的最佳时机
【题目】买卖股票的最佳时机原文地址:https://copyfuture.com/blogs-details/2020011113393672457wxpb9gxgbqzvf题目名称买卖股票的最佳时机题目地址https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/题目描述给定一个数组,它的第 i 个...原创 2020-01-11 13:40:52 · 1250 阅读 · 0 评论 -
经典算法面试题目-判断s2是否是s1的旋转字符串(1.8)
题目Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, s1 and s2, write code to check if s2 is a rotation of s1 using only one call to isSubstr原创 2016-08-05 23:28:40 · 10313 阅读 · 0 评论 -
经典算法面试题目-置矩阵行列元素为0(1.7)
题目Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column is set to 0.写一个函数处理一个MxN的矩阵,如果矩阵中某个元素为0,那么把它所在的行和列都置为0.解答简单题。遍历一次矩阵,当遇到元素等于0时,记录下这个元素对应的行和列。 可原创 2016-07-31 23:15:14 · 7337 阅读 · 0 评论 -
经典算法面试题目-矩阵旋转90度(1.6)
题目Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in place?一张图像表示成NxN的矩阵,图像中每个像素是4个字节,写一个函数原创 2016-07-31 05:07:32 · 29632 阅读 · 4 评论 -
经典算法面试题目-替换字符串的内容(1.5)
题目Write a method to replace all spaces in a string with ‘%20’.写一个函数,把字符串中所有的空格替换为%20 。解答简单题(有2种方法,一种时间耗费大些,一种空间耗费大点,根据需要去选择就好了)第一种方法:(需要一个多余的空间开销-就是多一个原字符串的开销) 先遍历一次字符串,得到空格个数,进而得到将空格转换成%20后的串长度 (每个空格原创 2016-07-27 22:32:54 · 13874 阅读 · 0 评论 -
经典算法面试题目-判断两个字符串是否是变位词(1.4)
题目Write a method to decide if two strings are anagrams or not.写一个函数判断两个字符串是否是变位词。解答变位词(anagrams)指的是组成两个单词的字符相同,但位置不同的单词。比如说, abbcd和abcdb就是一对变位词。 也就是说,2个字符串,不管排列顺序如何,只要全部的单个字符能对应上,就是一对变位词!该题目有两种做法:时间复杂原创 2016-07-23 23:30:19 · 16667 阅读 · 0 评论 -
经典算法面试题目-设计算法移除字符串中重复的字符(1.3)
题目Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer. NOTE: One or two additional variables are fine. An extra copy of the array is no原创 2016-07-22 14:40:21 · 15216 阅读 · 0 评论 -
经典算法面试题目-翻转一个C风格的字符串(1.2)
题目: Write code to reverse a C-Style String. (C-String means that “abcd” is represented as five characters, including the null character.)写代码翻转一个C风格的字符串。(C风格的意思是”abcd”需要用5个字符来表示,包含末尾的 结束字符)解答: 这道题如果原创 2016-07-20 16:21:22 · 6513 阅读 · 0 评论 -
经典算法面试题目-判断一个字符串中的字符是否唯一(1.1)
题目: Implement an algorithm to determine if a string has all unique characters. What if you can not use additional data structures?实现一个算法来判断一个字符串中的字符是否唯一(即没有重复).不能使用额外的数据结构。 (即只使用基本的数据结构)解答: 首先,你原创 2016-07-19 13:26:54 · 3519 阅读 · 0 评论 -
HDOJ/HDU 1242 Rescue(经典BFS深搜-优先队列)
Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.Angel’s原创 2016-07-10 17:09:07 · 8632 阅读 · 0 评论 -
HDOJ/HDU 1180 诡异的楼梯(经典BFS-详解)
Problem Description Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的,相反,他们每隔一分钟就变动一次方向. 比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线,这时Ron(Harry最好的朋友)告诉Harry正好有一个魔法道具可原创 2016-07-10 16:25:08 · 9567 阅读 · 0 评论 -
HDOJ/HDU 1372 Knight Moves(经典BFS)
Problem Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n s原创 2016-07-06 22:13:08 · 8000 阅读 · 0 评论 -
HDOJ/HDU 1241 Oil Deposits(经典DFS)
Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a原创 2016-07-05 17:01:29 · 8586 阅读 · 0 评论 -
HDOJ/HDU Tempter of the Bone(深搜+奇偶性剪枝)
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He rea原创 2016-07-04 14:21:25 · 8851 阅读 · 0 评论 -
HDOJ/HDU 1085 Holding Bin-Laden Captive!(非母函数求解)
Problem Description We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zhou of China! “Oh, God! How terri原创 2016-06-26 17:06:34 · 9043 阅读 · 0 评论 -
HDOJ/HDU 1029 Ignatius and the Princess IV(简单DP,排序)
此题无法用JavaAC,不相信的可以去HD1029题试下!Problem Description “OK, you are not too bad, em… But you can never pass the next test.” feng5166 says.“I will tell you an odd number N, and then N integers. There will be原创 2016-06-18 22:27:46 · 9737 阅读 · 0 评论 -
HDOJ/HDU 1022 Train Problem I(模拟栈)
Problem Description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is th原创 2016-06-14 18:10:59 · 8685 阅读 · 0 评论 -
HDOJ/HDU 1015 Safecracker(深搜)
Problem Description === Op tech briefing, 2002/11/02 06:42 CST === “The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, al原创 2016-06-14 17:15:28 · 7367 阅读 · 0 评论 -
HDOJ/HDU 1015 Safecracker(枚举、暴力)
Problem Description === Op tech briefing, 2002/11/02 06:42 CST === “The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, al原创 2016-06-14 16:43:57 · 3255 阅读 · 0 评论 -
HDOJ/HDU 2565 放大的X(分段思考~)
Problem Description 请你编程画一个放大的’X’。 如3*3的’X’应如下所示:X X XX X5*5的’X’如下所示:X X X X X X XX XInput 输入数据第一行是一个整数T,表示有T组测试数据; 接下来有T行,每行有一个正奇数n(3 <= n <= 79),表示放大的规格。Output 对于每一个n打印一个规格为n * n放大的’X’;每组输出原创 2016-06-05 01:56:48 · 4005 阅读 · 0 评论 -
HDOJ/HDU 2564 词组缩写(单词缩写)
Problem Description 定义:一个词组中每个单词的首字母的大写组合称为该词组的缩写。 比如,C语言里常用的EOF就是end of file的缩写。Input 输入的第一行是一个整数T,表示一共有T组测试数据; 接下来有T行,每组测试数据占一行,每行有一个词组,每个词组由一个或多个单词组成;每组的单词个数不超过10个,每个单词有一个或多个大写或小写字母组成; 单词长度不超过1原创 2016-06-05 01:37:30 · 5906 阅读 · 0 评论 -
HDOJ/HDU 2352 Verdis Quo(罗马数字与10进制数的转换)
Problem Description The Romans used letters from their Latin alphabet to represent each of the seven numerals in their number system. The list below shows which letters they used and what numeric val原创 2016-06-05 01:29:02 · 6151 阅读 · 0 评论 -
HDOJ/HDU 2203 亲和串(简单的判断~Java的indexOf()方法秒)
Problem Description 人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。 亲和串的定义是这样的:给定两个字符串s1和s2,如果能通过s1循环移位,使s2包含在s1中,那么我原创 2016-06-05 00:57:25 · 4566 阅读 · 0 评论 -
HDOJ/HDU 2163 Palindromes(判断回文串~)
Problem Description Write a program to determine whether a word is a palindrome. A palindrome is a sequence of characters that is identical to the string when the characters are placed in reverse orde原创 2016-06-05 00:50:02 · 5333 阅读 · 0 评论 -
HDOJ/HDU 2140 Michael Scofield's letter(字符转换~)
Problem Description I believe many people are the fans of prison break. How clever Michael is!! In order that the message won’t be found by FBI easily, he usually send code letters to Sara by a paper原创 2016-06-05 00:21:30 · 4192 阅读 · 0 评论 -
HDOJ/HDU 2087 剪花布条(indexOf()应用~~)
Problem Description 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢?Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符,则原创 2016-06-02 14:03:35 · 3607 阅读 · 0 评论 -
HDOJ/HDU 1984 Mispelling4(删除第n个字符~)
Problem Description Misspelling is an art form that students seem to excel at. Write a program that removes the nth character from an input string.Input The first line of input contains a single inte原创 2016-06-02 13:42:28 · 10592 阅读 · 0 评论 -
HDOJ/HDU 1982 Kaitou Kid - The Phantom Thief (1)(字符串处理)
Problem Description Do you know Kaitou Kid? In the legend, Kaitou Kid is a master of disguise, and can take on the voice and form of anyone. He is not an evil person, but he is on the wrong side of th原创 2016-06-02 13:29:06 · 7691 阅读 · 0 评论 -
HDOJ/HDU 1804 Deli Deli(英语单词复数形式~)
Problem Description Mrs. Deli is running the delicatessen store “Deli Deli”. Last year Mrs. Deli has decided to expand her business and build up an online store. She has hired a programmer who has imp原创 2016-06-02 11:40:23 · 7677 阅读 · 0 评论 -
HDOJ/HDU 1328 IBM Minus One(水题一个,试试手)
Problem Description You may have heard of the book ‘2001 - A Space Odyssey’ by Arthur C. Clarke, or the film of the same name by Stanley Kubrick. In it a spaceship is sent from Earth to Saturn. The cr原创 2016-06-01 16:32:24 · 10089 阅读 · 0 评论 -
HDOJ/HDU 1256 画8(绞下思维~水题)
Problem Description 谁画8画的好,画的快,今后就发的快,学业发达,事业发达,祝大家发,发,发.Input 输入的第一行为一个整数N,表示后面有N组数据. 每组数据中有一个字符和一个整数,字符表示画笔,整数(>=5)表示高度.Output 画横线总是一个字符粗,竖线随着总高度每增长6而增加1个字符宽.当总高度从5增加到6时,其竖线宽度从1增长到2.下圈高度不小于上圈高度,但原创 2016-05-28 15:46:09 · 5755 阅读 · 0 评论 -
HDOJ/HDU 1251 统计难题(字典树啥的~Map水过)
Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提原创 2016-05-27 21:11:27 · 4599 阅读 · 0 评论 -
HDOJ/HDU 1200 To and Fro(加密解密字符串)
Problem Description Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extr原创 2016-05-27 16:23:24 · 7202 阅读 · 0 评论 -
HDOJ/HDU 1161 Eddy's mistakes(大写字母转换成小写字母)
Problem Description Eddy usually writes articles ,but he likes mixing the English letter uses, for example “computer science” is written frequently “coMpUtEr scIeNce” by him, this mistakes lets Eddy’s原创 2016-05-27 15:21:12 · 4630 阅读 · 0 评论 -
HDOJ/HDU 1113 Word Amalgamation(字典顺序~Map)
Problem Description In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in原创 2016-05-27 15:12:14 · 4249 阅读 · 0 评论 -
HDOJ/HDU 1088 Write a simple HTML Browser(HTML字符串)
Problem Description If you ever tried to read a html document on a Macintosh, you know how hard it is if no Netscape is installed. Now, who can forget to install a HTML browser? This is very easy be原创 2016-05-27 02:32:35 · 12065 阅读 · 0 评论 -
HDOJ/HDU 5686 Problem B(斐波拉契+大数~)
Problem Description 度熊面前有一个全是由1构成的字符串,被称为全1序列。你可以合并任意相邻的两个1,从而形成一个新的序列。对于给定的一个全1序列,请计算根据以上方法,可以构成多少种不同的序列。Input 这里包括多组测试数据,每组测试数据包含一个正整数N,代表全1序列的长度。1≤N≤200 Output 对于每组测试数据,输出一个整数,代表由题目中所给定的全1序列所能形原创 2016-05-26 22:20:08 · 5202 阅读 · 0 评论 -
HDOJ/HDU 1556 Color the ball(树状数组)
Problem Description N个气球排成一排,从左到右依次编号为1,2,3….N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽”牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了,你能帮他算出每个气球被涂过几次颜色吗?Input 每个测试实例第一行为一个整数N,(N <= 100000).接下来的N原创 2016-05-26 22:11:02 · 4305 阅读 · 0 评论 -
HDOJ/HDU 1075 What Are You Talking About(字符串查找翻译~Map)
Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn’t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves原创 2016-05-26 21:43:03 · 6543 阅读 · 0 评论