fssssssss的专栏

网上流行的一道题目，题目如下。最终利用穷取法来递归解决的。 一个整数数组，长度为n，将其分为m 份，使各份的和相等，求m 的最大值 比如{3，2，4，3，6} 可以分成{3，2，4，3，6} m=1; {3,6}{2,4,3} m=2 {3,3}{2,4}{6} m=3 所以m 的最大值为3 using System; using System.Collections.Generic;

#include using namespace std; //bubble sort void BubbleSort(int *arr,int left,int right) { int temp; for(int i=right-1;i>=left;i--) { for(int j=left;j<=i;j++) { if(arr[j]>arr[j+1]) {

Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input st

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine i

转载：http://blog.youkuaiyun.com/wuzhekai1985/article/details/6718256   问题描述：多人排成一个队列，我们认为从低到高是正确的序列，但是总有部分人不遵守秩序。如果说，前面的人比后面的人高(两人身高一样认为是合适的)，那么我们就认为这两个人是一对“捣乱分子”，比如说,现在存在一个序列:176, 178, 180, 170, 171

using System; using System.Collections.Generic; using System.Text; using System.Collections; using System.IO; using System.Threading; using System.IO.Ports; namespace Program { class Program

#include "point.h" using namespace std; int CalcOneHelp(int); int CalcOne(int); int power(int ,int); int CalcOne(int N)//穷举法，比较傻瓜，思路简单，运算速度慢 { int sum=0; for(int i=1;i<=N;i++) sum+=CalcOneHelp(i)

Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Note: A solution using O(n) space is pretty straight forward. Could you devis