GeeksForGeeks
文章平均质量分 80
chiiis
这个作者很懒,什么都没留下…
展开
-
Rotate bits of a number 左旋转或右旋转一个数 @GFG
Bit Rotation: A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end.In left rotation, the bits that fall原创 2013-11-13 02:16:31 · 1929 阅读 · 0 评论 -
DP9 二项式系数 Binomial Coefficient @geeksforgeeks
Following are common definition of Binomial Coefficients.1) A binomial coefficient C(n, k) can be defined as the coefficient of X^k in the expansion of (1 + X)^n.2) A binomial coefficient C(n, k原创 2013-12-25 05:38:42 · 1446 阅读 · 0 评论 -
DP16 Floyd Warshall Algorithm @geeksforgeeks
The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem. The problem is to find shortest distances between every pair of vertices in a given edge weighted directed Graph.原创 2013-12-27 03:07:16 · 1478 阅读 · 0 评论 -
DP17 最少回文切割次数 Palindrome Partitioning @geeksforgeeks
Given a string, a partitioning of the string is a palindrome partitioning if every substring of the partition is a palindrome. For example, “aba|b|bbabb|a|b|aba” is a palindrome partitioning of “ababb原创 2013-12-27 03:55:35 · 1935 阅读 · 0 评论 -
DP18 分割区间问题 Partition problem @geeksforgeeks
思路:把能否划分区间的问题转化为能不能找到一个使得和为总和的一半的子区间,然后转为01背包问题,分析每一个元素是否取Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets原创 2013-12-27 04:44:06 · 2274 阅读 · 0 评论 -
DP19 自动换行问题 Word Wrap Problem @geeksforgeeks
挺复杂的一题,用了多个dp数组来保存过程量Given a sequence of words, and a limit on the number of characters that can be put in one line (line width). Put line breaks in the given sequence such that the lines ar原创 2013-12-27 07:34:51 · 2274 阅读 · 0 评论 -
DP20 求pair的最大长度链 Maximum Length Chain of Pairs @geeksforgeeks
是LIS的变型题,如果遇到两维则先排序一维再对另一维动态规划You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. A pair (c, d) can follow another pair (a, b) if b < c. C原创 2013-12-27 09:33:16 · 1553 阅读 · 0 评论 -
DP25 子集和问题 Subset Sum Problem @geeksforgeeks
同分割区间问题:http://blog.csdn.net/fightforyourdream/article/details/17602699Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to give原创 2013-12-28 06:35:50 · 2409 阅读 · 0 评论 -
DP22 堆盒子问题 Box Stacking Problem @geeksforgeeks
You are given a set of n types of rectangular 3-D boxes, where the i^th box has height h(i), width w(i) and depth d(i) (all real numbers). You want to create a stack of boxes which is as tall as possi原创 2013-12-28 03:19:33 · 3274 阅读 · 0 评论 -
DP23 Bellman–Ford Algorithm @geeksforgeeks
Given a graph and a source vertex src in graph, find shortest paths from src to all vertices in the given graph. The graph may contain negative weight edges.We have discussed Dijkstra’s algorithm fo原创 2013-12-28 04:57:56 · 2708 阅读 · 0 评论 -
DP21 LIS的变种问题-建桥问题 Variations of LIS-Building Bridge @geeksforgeeks
We have discussed Dynamic Programming solution for Longest Increasing Subsequence problem inthis post and a O(nLogn) solution in this post. Following are commonly asked variations of the standard LI原创 2013-12-28 02:23:47 · 2049 阅读 · 0 评论 -
DP24 最优BST Optimal Binary Search Tree @geeksforgeeks
Given a sorted array keys[0.. n-1] of search keys and an array freq[0.. n-1] of frequency counts, wherefreq[i] is the number of searches to keys[i]. Construct a binary search tree of all keys such tha原创 2013-12-28 06:05:29 · 2526 阅读 · 0 评论 -
分治法 Divide and Conquer - Closest Pair of Points 找最近点对
分治法找最近点对,可以把时间复杂度从暴力的O(n^2)降低到O(nlogn)We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number原创 2014-02-21 02:16:41 · 7308 阅读 · 1 评论 -
DP31 取大小游戏中的最优策略(附:如何对DP[0][n]进行对角线递推) Optimal Strategy for a Game @geeksforgeeks
Problem statement: Consider a row of n coins of values v1 . . . vn, where n is even. We play a game against an opponent by alternating turns. In each turn, a player selects either the first or last co原创 2013-12-29 13:23:48 · 1956 阅读 · 0 评论 -
DP29 最长相同子串 Longest Common Substring @geeksforgeeks
Given two strings ‘X’ and ‘Y’, find the length of the longest common substring. For example, if the given strings are “GeeksforGeeks” and “GeeksQuiz”, the output should be 5 as longest common substrin原创 2013-12-29 03:30:59 · 1881 阅读 · 0 评论 -
DP8 矩阵链相乘 Matrix Chain Multiplication @geeksforgeeks
思路是在矩阵链的每一个地方分别分开,然后找最小Given a sequence of matrices, find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but merely to deci原创 2013-12-25 05:24:11 · 1699 阅读 · 0 评论 -
DP10 0-1背包问题 0-1 Knapsack Problem @geeksforgeeks
01背包问题的取和不取实际上就是一个机会成本的问题,如果取了某件东西,尽管当前的价值暂时地增加了,但你付出了机会成本。因为如果不取,留下的空间以后说不定可以放更有价值的东西。因此空间和价值总是一对矛盾。我们的目的是要用有限的空间装入最优价值的东西。Given weights and values of n items, put these items in a knapsack原创 2013-12-25 06:19:48 · 1689 阅读 · 0 评论 -
DP27 2D矩阵中最大的矩形和 Maximum sum rectangle in a 2D matrix @geeksforgeeks
Given a 2D array, find the maximum sum subarray in it. For example, in the following 2D array, the maximum sum subarray is highlighted with blue rectangle and sum of this subarray is 29.This p原创 2013-12-29 01:46:56 · 2901 阅读 · 0 评论 -
DP28 求能变成回文的最小插入字符个数 Minimum insertions to form a palindrome @geeksforgeeks
Given a string, find the minimum number of characters to be inserted to convert it to palindrome.Before we go further, let us understand with few examples: ab: Number of insertions required i原创 2013-12-29 02:59:43 · 1670 阅读 · 0 评论 -
DP30 求骰子能凑成给定和的组合数 Dice Throw @geeksforgeeks
Given n dice each with m faces, numbered from 1 to m, find the number of ways to get sum X. X is the summation of values on each face when all the dice are thrown.The Naive approach is to find all原创 2013-12-29 04:24:27 · 4413 阅读 · 0 评论 -
DP26树的最大独立子集问题 Largest Independent Set Problem @geeksforgeeks
Given a Binary Tree, find size of the Largest Independent Set(LIS) in it. A subset of all tree nodes is an independent set if there is no edge between any two nodes of the subset.For example, consid原创 2013-12-29 00:27:29 · 2325 阅读 · 0 评论 -
DP32 单词按照字典分割问题 Word Break Problem @geeksforgeeks
Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. See following examples for more details.This is a原创 2013-12-30 01:11:39 · 2115 阅读 · 0 评论 -
DP34 流水线调度问题 Assembly Line Scheduling @geeksforgeeks
A car factory has two assembly lines, each with n stations. A station is denoted by Si,j where i is either 1 or 2 and indicates the assembly line the station is on, and j indicates the number of the s原创 2013-12-30 05:58:25 · 3199 阅读 · 0 评论 -
DP36 如何切出最大长度乘积 Maximum Product Cutting @geeksforgeeks
Given a rope of length n meters, cut the rope in different parts of integer lengths in a way that maximizes product of lengths of all parts. You must make at least one cut. Assume that the length of r原创 2013-12-30 07:17:43 · 2719 阅读 · 0 评论 -
DP33 两个字符串交叉得到的字符串 Find if a string is interleaved of two other strings @geeksforgeeks
Given three strings A, B and C. Write a function that checks whether C is an interleaving of A and B. C is said to be interleaving A and B, if it contains all characters of A and B and order of all原创 2013-12-30 03:37:41 · 1963 阅读 · 0 评论 -
DP35 最长等差数列 Longest Arithmetic Progression @geeksforgeeks
在一个有序数组里找等差数列,用3个指针,以中间指针为基准,移动前后指针。Given a set of numbers, find the Length of the Longest Arithmetic Progression (LLAP) in it.Examples:set[] = {1, 7, 10, 15, 27, 29}output = 3The lo原创 2013-12-30 06:59:32 · 2096 阅读 · 0 评论 -
DP4 最长公共子序列 LCS @geeksforgeeks
LCS Problem Statement: Given two sequences, find the length of longest subsequence present in both of them. A subsequence is a sequence that appears in the same relative order, but not necessarily con原创 2013-12-24 00:36:58 · 1589 阅读 · 0 评论 -
DP3 最长上升子序列 LIS @geeksforgeeks
package DP;import java.util.Arrays; // 最长递增子序列-Longest Increasing Subsequence/**Let arr[0..n-1] be the input array and L(i) be the length of the LIS till index i such that arr[i] is part of LIS原创 2013-12-24 00:17:14 · 1478 阅读 · 0 评论 -
DP6 最小路径花费 Min Cost Path @geeksforgeeks
Dynamic Programming | Set 6 (Min Cost Path)Given a cost matrix cost[][] and a position (m, n) in cost[][], write a function that returns cost of minimum cost path to reach (m, n) from (0, 0)原创 2013-12-24 02:19:41 · 1828 阅读 · 0 评论 -
DP5 编辑距离 Edit Distance @geeksforgeeks
Problem: Given two strings of size m, n and set of operations replace (R), insert (I) and delete (D) all at equal cost. Find minimum number of edits (operations) required to convert one string into an原创 2013-12-24 01:03:49 · 1566 阅读 · 0 评论 -
DP7 两道换硬币的问题 Coin Change @geeksforgeeks
1 Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t m原创 2013-12-25 04:38:39 · 2528 阅读 · 0 评论 -
DP11 高楼扔鸡蛋问题 Egg Dropping Puzzle @geeksforgeeks
package DP;/** * 100层楼,两个鸡蛋。某层之上扔鸡蛋就会碎。问至少要测试多少次才能找出这层楼来 * 我们可以决定怎么扔(min),但必须假设我们的运气最差(max) * * 100层楼,两个鸡蛋。某层之上扔鸡蛋就会碎。问至少要测试多少次才能找出这层楼来?思路:首先要理解清楚题意,本题不是要找在哪一层以上会把鸡蛋扔破!而是我们假设在W层以上会把鸡蛋仍破,现在问原创 2013-12-26 02:18:50 · 1489 阅读 · 0 评论