首页
学习
活动
专区
圈层
工具
发布
    • 综合排序
    • 最热优先
    • 最新优先
    时间不限
  • 【POJ】2001 - Shortest Prefixes(字典树)

    点击打开题目 Shortest Prefixes Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 17357 Accepted In this problem, given a set of words, you will find for each word the shortest prefix that uniquely output contains the word from the corresponding line of the input, followed by one blank space, and the shortest

    25410编辑于 2025-08-26
  • 来自专栏数据结构与算法

    POJ 2001 Shortest Prefixes

    In this problem, given a set of words, you will find for each word the shortest prefix that uniquely output contains the word from the corresponding line of the input, followed by one blank space, and the shortest

    68990发布于 2018-04-12
  • 来自专栏Reck Zhang

    LeetCode 0214 - Shortest Palindrome

    Shortest Palindrome Desicription Given a string s, you are allowed to convert it to a palindrome by adding Find and return the shortest palindrome you can find by performing this transformation.

    24930发布于 2021-08-11
  • 来自专栏SnailTyan

    Shortest Bridge

    elif grid[x][y+1] == 1: return count Reference https://leetcode.com/problems/shortest-bridge

    48430发布于 2021-08-10
  • 来自专栏LeetCode

    Manacher算法 && Longest && Shortest Palindrome

    } max = Math.max(max,pArr[i]); } return max - 1; } 二、214.Shortest Find and return the shortest palindrome you can find by performing this transformation.

    44120发布于 2019-02-22
  • 来自专栏计算机视觉与深度学习基础

    Shortest Palindrome

    Find and return the shortest palindrome you can find by performing this transformation.

    86080发布于 2018-01-12
  • 来自专栏全栈程序员必看

    hdu 3631 Shortest Path(Floyd)

    题目链接:Shortest Path Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others GUO asked them to solve the following shortest-path problem. (2) Find the shortest-path between two vertices only through marked vertices. At this moment, YY decided to help LMY to analyze the shortest-path problem. Could you also solve the shortest-path problem?

    30510编辑于 2022-07-10
  • 来自专栏算法修养

    HDU 5636 Shortest Path(Floyed,枚举)

    Shortest Path Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)

    65380发布于 2018-04-26
  • 来自专栏chenjx85的技术专栏

    leetcode-821-Shortest Distance to a Character

    题目描述: Given a string S and a character C, return an array of integers representing the shortest distance

    80460发布于 2018-05-21
  • 来自专栏全栈程序员必看

    Leetcode: Shortest Word Distance II

    This is a follow up of Shortest Word Distance. words in the constructor, and implements a method that takes two words word1 and word2 and return the shortest 15 map.put(item, list); 16 } 17 } 18 } 19 20 public int shortest instantiated and called as such: 37 // WordDistance wordDistance = new WordDistance(words); 38 // wordDistance.shortest ("word1", "word2"); 39 // wordDistance.shortest("anotherWord1", "anotherWord2"); 发布者:全栈程序员栈长,转载请注明出处:

    31530编辑于 2022-07-05
  • 来自专栏一Wa哇一天

    Shortest and Longest LIS

    Shortest and Longest LIS time limit per test3 seconds memory limit per test256 megabytes inputstandard In the second case, the shortest length of the LIS is 2, and the longest length of the LIS is 3.

    42110发布于 2020-04-09
  • 来自专栏SnailTyan

    Shortest Unsorted Continuous Subarray

    } } return end - start + 1; } }; Reference https://leetcode.com/problems/shortest-unsorted-continuous-subarray

    41520发布于 2019-05-25
  • 来自专栏SnailTyan

    Shortest Path in Binary Matrix

    queue.append((i+1, j+1, count)) return -1 Reference https://leetcode.com/problems/shortest-path-in-binary-matrix

    41710发布于 2021-08-06
  • 来自专栏刷题笔记

    Shortest Unsorted Continuous Subarray

    You need to find the shortest such subarray and output its length. 来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray 著作权归领扣网络所有

    47410发布于 2019-11-07
  • 来自专栏vblog

    PAT 1046 Shortest Distance (20分)

    really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest Output Specification: For each test case, print your results in M lines, each contains the shortest

    38820发布于 2020-07-14
  • 来自专栏小樱的经验随笔

    Shortest Distance in a Line

    Write a query to find the shortest distance between two points in these points. | x | |-----| | -1 | | 0 | | 2 | The shortest distance is '1' obviously, which is from point '-1' to '0'. So the output is as below: | shortest| |---------| | 1 | Note: Every point is unique, which means MySQL 语句如下: SELECT MIN(ABS(x1.x - x2.x)) AS shortest FROM point AS x1 JOIN point AS

    57430发布于 2019-01-30
  • 来自专栏chenjx85的技术专栏

    leetcode-581-Shortest Unsorted Continuous Subarray

    You need to find the shortest such subarray and output its length.

    48140发布于 2019-03-14
  • 来自专栏机器学习入门

    Shortest Completing Word

    Shortest Completing Word 传送门:748. Shortest Completing Word Problem: Find the minimum length word from a given dictionary words, which

    76590发布于 2018-01-02
  • 来自专栏ml

    hdu-----(2807)The Shortest Path(矩阵+Floyd)

    The Shortest Path Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Output the shortest distance from X to Y. If not, output "Sorry".

    1K50发布于 2018-03-26
  • 来自专栏数据结构与算法

    The Shortest Statement(最短路)

    由于边数的限制,非树边连接的点不会超过$2*(m - (n - 1)) = 42$个

    48040发布于 2018-09-30
领券