执剑者罗辑的博客

对Linux/Unix风格的绝对路径进行简化。

Given an array of words and a width *maxWidth*, format the text such that each line has exactly *maxWidth* characters and is fully (left and right) justified. 对给出的字符串数组，根据每行的最大长度限制，进行两端对齐的格式化操作。

Validate if a given string can be interpreted as a decimal number.判断给出地字符串是不是实数

Given n and k, return the kth permutation sequence.求出n个数字的全排列中的第k个排列。

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.给出一个包含`n`个非负整数的数组，表示每个宽度为 1 的柱子的高度图，计算按此排列的柱子，下雨之后能接多少雨水。

Given an unsorted integer array, find the smallest missing positive integer.找出无序int类型数组中，缺失的最小的正整数。

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. 找出数组中所有可能的组合，其和等于target。每个元素可以被多次选中。

Write a program to solve a Sudoku puzzle by filling the empty cells. 数独求解。

Given a string containing just the characters `'('` and `')'`, find the length of the longest valid (well-formed) parentheses substring.

Divide Two Integers文章目录Divide Two Integers题目分析代码如下题目Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.Return the quotient after d...

Reverse Nodes in k-Group文章目录Reverse Nodes in k-Group题目分析代码如下题目Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less t...

Merge k Sorted Lists文章目录Merge k Sorted Lists题目分析代码如下题目Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.Example:Input:[ 1->4->5, 1->3...

Remove Nth Node From End of List文章目录Remove Nth Node From End of List题目分析代码如下题目Given a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2...

文章目录Regular Expression Matching题目分析解法1解法2代码如下解法1代码解法2代码Regular Expression Matching题目Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'....

给出一个m * n的矩阵，机器人只能向右走或者是向左走。求机器人从右上角到左下角，一共有多少种走法。（使用动态规划求解）

题目Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer

题目In the EXACT 4SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four literals,  and such that each variable occurs at most once in each clause. The goal is to

题目Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i

题目Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order ofO(log n).If t

题目There are two sorted arrays nums1 andnums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:num

题目Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()

题目Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest poss

题目Given an array S of n integers, are there elementsa, b, c in S such that a + b +c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not con

题目1Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.2Given a roman numeral, convert it to an integer.Input is guaranteed to

题目Given two non-negative integers num1 and num2 represented as strings, return the product ofnum1 and num2.Note:The length of both num1 and num2 is Both num1 and num2 contains only digits

题目Given a string s, find the longest palindromic substring ins. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also a valid answer.

题目1. Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2],

题目Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit

题目Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution using O

题目Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to st

题目The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L

题目Implement pow(x, n).Example 1:Input: 2.00000, 10Output: 1024.00000Example 2:Input: 2.10000, 3Output: 9.26100

题目Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is"abc", which the length is 3.Given "bbbbb", the answer is "b