随笔分类 - 算法
摘要：问题描述：You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of element
阅读全文
摘要：Remove Duplicates from Sorted List ： Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1
阅读全文
摘要：问题描述： Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where
阅读全文
摘要：问题描述： Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example,If n
阅读全文
摘要：问题描述： Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which th
阅读全文
摘要：问题描述：给定字符串S，子串T，求S中包含T的最小窗口 Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n
阅读全文
摘要：问题描述：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order
阅读全文
摘要：问题描述：矩阵每一行有序，每一行的最后一个元素小于下一行的第一个元素，查找。 算法分析：这样的矩阵其实就是一个有序序列，可以使用折半查找算法。 问题描述：二维矩阵行有序，列有序，进行查找。 算法分析：有两种方法，一种是将矩阵按中心点分成左上，左下，右上，右下，四部分，进行递归查找。 还有一种比较巧妙
阅读全文
摘要：问题描述： 题目描述Edit DistanceGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counte
阅读全文
摘要：问题描述：把一个集合的单词按照每行L个字符放，每行要两端对齐，如果空格不能均匀分布在所有间隔中，那么左边的空格要多于右边的空格，最后一行靠左对齐。 words: ["This", "is", "an", "example", "of", "text", "justification."]L: 16.
阅读全文
摘要：算法分析：利用折半查找，降低算法复杂度。前面求x得y次幂，也是将y/2，都是为了降低复杂度。
阅读全文
摘要：问题描述： Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100".
阅读全文
摘要：问题描述：一个数组每一位代表一个数字的每一位。数字高位在数组的低位。求数字加1后得到新数组。 算法分析：要从数组的高位到低位进行遍历。
阅读全文
摘要：问题描述： Validate if a given string is numeric. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true
阅读全文
摘要：问题描述：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its p
阅读全文
摘要：UniquePaths：给定m*n矩阵，从（0，0）到（m-1，n-1）路径条数。只能向下向右走。 算法分析：这和爬楼梯问题很像，到（m，n）的路径数是到（m-1，n)和（m，n-1）路径和。第一行，第一列，为边界条件。 UniquePaths2：在上一题基础上，矩阵为1的点是障碍。求路径数。
阅读全文
摘要：Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word
阅读全文
摘要：Merge Interval: Given a collection of intervals, merge all overlapping intervals. For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15
阅读全文
摘要：SpiralMatrix： Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example,Given the following
阅读全文
摘要：问题描述： ind the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,
阅读全文
浙公网安备 33010602011771号