创新工场二面试题！已经跪了，求解答！

yangxuefeng09 2015-09-29 09:00:09

加精

创新工场二面的面试官，问了我一个题目，我直接就跪在那里了！题目如下：

4=1+1+1+1
=1+1+2
=1+3
=2+2

比如数字4 可以被拆解成为如上的四种情况。那么我现在给你一个vector< vector<int> > 你把所有的结果全部的保存到这个

vector< vector<int> > 中。

函数的函数体，应该是这个样子的 vector< vector<int> > & fun(int n){ //函数体 }

让我写出这个函数的代码，但是我写不出来，甚至连算法我都没有思路。

可能大家觉的4还是很容易的，但是我给你100，那么：
100=59+41
=58+42
=57+43
。。。。
=1+99
=1+1+98
=1+1+97

等等结果非常的多我也不知道该如何拆分

求前辈解答

面试跪了，跪的心服口服但是这个题目还是不会求帮助

...全文

11393 87 打赏收藏转发到动态举报

写回复

用AI写文章

87 条回复

切换为时间正序

请发表友善的回复…

发表回复

yhm357101232 2019-07-18

打赏
举报

using namespace std;

vector<vector<int>> result;

vector<vector<int>>& func(int n) {
if (n == 1) {
result.clear();
vector<int> a = { 1 };
result.push_back(a);
return result;
}
else {
result = func(n - 1);

vector<vector<int>> r2;

for (int i = 1; i < n+1; i++) {
for (auto& iter : result) {
if (iter.end()- iter.begin() < i) break;
if (i < (*(iter.begin()+i-1)) + 1) {
int sum = i;
vector<int> b;
for (auto it = (iter.begin() + i - 1); it < iter.end(); it++) sum += *it;
if (sum == n) {
b.push_back(i);
b.insert(b.end(), (iter.begin() + i - 1), iter.end());
r2.push_back(b);
}
}
}

}
result = r2;
vector<int> a = { n };
result.push_back(a);
return result;
}

}

int main()
{
for (auto iter : func(10)) {
for (auto subitor : iter) {
cout << subitor << ",";
}
cout << endl;
}

return 0;

}

1,1,1,1,1,1,1,1,1,1,
1,1,1,1,1,1,1,1,2,
1,1,1,1,1,1,1,3,
1,1,1,1,1,1,2,2,
1,1,1,1,1,1,4,
1,1,1,1,1,2,3,
1,1,1,1,1,5,
1,1,1,1,2,2,2,
1,1,1,1,2,4,
1,1,1,1,3,3,
1,1,1,1,6,
1,1,1,2,2,3,
1,1,1,2,5,
1,1,1,3,4,
1,1,1,7,
1,1,2,2,2,2,
1,1,2,2,4,
1,1,2,3,3,
1,1,2,6,
1,1,3,5,
1,1,4,4,
1,1,8,
1,2,2,2,3,
1,2,2,5,
1,2,3,4,
1,2,7,
1,3,3,3,
1,3,6,
1,4,5,
1,9,
2,2,2,2,2,
2,2,2,4,
2,2,3,3,
2,2,6,
2,3,5,
2,4,4,
2,8,
3,3,4,
3,7,
4,6,
5,5,
10,

yhm357101232 2019-07-18

打赏
举报

虎背人腰_ 2017-10-10

打赏
举报

不错，还是蛮好的~

Crazy_Bookman 2016-05-14

打赏
举报


#include "Header.h"
vector<vector<int> > func(int n)
{
	vector<vector<int> > groups;
	if(n == 1) groups.push_back(vector<int>(1,1));
	else
	{
		for(int i = 1; i != n/2 + 1; ++i)
		{
			vector<int> comb;
			for(int j = i; j != n-i+1; ++j)
			{
				comb.push_back(i);
				for(int k = 0; k != n - i - j; ++k)
					comb.push_back(1);
				comb.push_back(j);
				groups.push_back(comb);
				comb.clear();
			}		
		}	
	}	
	return groups;	
}

Crazy_Bookman 2016-05-14

打赏
举报

引用 36 楼 micropentium6 的回复:

楼上的各位大神，不带你们肿么玩的啊！写个代码你们都不测试啊？木有一个是对的！csdn这是肿么了！当然，赵老师的我没敢看，看也看不懂！ 10的分解有42种，凡是得不到这个数的，都罚十一加班20天！

可以去试试我的，测试过了

jakey0108 2016-04-01

打赏
举报

确实牛逼，大神真多，学习了

zeroandexe 2016-03-30

打赏
举报

vector<vector<int>> fun(int n){ vector<vector<int>> answer; for (int i = 1; i <= n/2; i++){ int max_j = n - i; for (int j = i; j <= max_j; j++){ int count_one = max_j - j; vector<int> temp; while (count_one--) temp.push_back(1); temp.push_back(j); temp.push_back(i); sort(temp.begin(), temp.end()); answer.push_back(temp); } } return answer; }

奋起无迹 2015-11-07

打赏
举报

研究下

w826207 2015-11-03

打赏
举报

http://blog.chinaunix.net/uid-26548237-id-3503956.html

HaoYuan 2015-10-18

打赏
举报

// ConsoleApplication1.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include<stdlib.h> #include <stdio.h> #include <vector> using namespace std; int g_Count = 0; void func(int n, vector<int>& vec) { if (n == 0) { if (vec.size() == 1) return; for (auto it = vec.begin(); it != vec.end(); it++) { printf("%3d", *it); } printf("\n"); g_Count++; } int iSize = vec.size(); for (int i = 1; i <= n; i++) { if (iSize > 0 && vec[iSize - 1] > i)//去重 continue; vec.push_back(i); func(n - i, vec); vec.pop_back(); } } int main() { int n = 10; vector<int> vect; func(n, vect); printf("一共%d个\n", g_Count); system("pause"); return 0; }

hy890319 2015-10-16

打赏
举报

值得学习哦，感谢各位

唱跳rap敲代码 2015-10-15

打赏
举报

package com.test;

import java.util.Scanner;
import java.util.Stack;
import java.util.Vector;

public class MainRun {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int input = scanner.nextInt();
		Vector<Vector<Integer>> result = new Vector<Vector<Integer>>();
		calc(result, input);
		for (Vector vec : result) {
			for (int i = 0; i < vec.size(); i++)
				System.out.print(vec.get(i) + " ");
			System.out.println();
		}
	}

	public static void calc(Vector<Vector<Integer>> vec, int n) {
		calc_(vec, n, 1, new Stack<Integer>());
	}

	private static void calc_(Vector<Vector<Integer>> vec, int n, int floor,
			Stack<Integer> tmp) {
		boolean end = false;
		for (int i = 1; i <= n; i++) {
			if (i < floor)
				continue;
			floor = i;
			tmp.push(i);
			calc_(vec, n - i, floor, tmp);
			tmp.pop();
			end = true;
		}
		if (end) {
			Vector<Integer> success = new Vector<Integer>();
			for (int i = 0; i < tmp.size(); i++)
				success.add(tmp.get(i));
			success.add(n);
			vec.add(success);
		}
	}
}

walkuere 2015-10-15

打赏
举报

我觉得应该先好几个小数字手算，算出用排列组合的公式，直接用排列组合的公式来，而不是无脑地递归枚举

小晏 2015-10-14

打赏
举报

写个数学方程式就出来了，没意思

whao_mobile 2015-10-14

打赏
举报

def class 
puts 'hello word!'
end

gpbgpbgpb 2015-10-13

打赏
举报

写了个JS版的，一个递归，一个是递归转的循环实现。不用编译，直接打开浏览器运行，在FIREFOX调试器里查看LOG：
＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝
<!DOCTYPE html>
<html>
<head lang="en">
<meta charset="UTF-8">
<title></title>
</head>
<script>
function test1 () {
var N = 10;
var deepLevel = 0;
var xVarArray = new Array(N);
//initialization xVarArray to Zero.
for (var idx = 0; idx < N; idx++) {
xVarArray[ idx ] = 0;
}

function condition () {
var sumOfTotal = 0;
for (var i = 0; i < deepLevel; i++) {
sumOfTotal += xVarArray[ i ];
}
if (sumOfTotal === N) return 'match';
else if (sumOfTotal < N) return 'less';
else return 'overflow';
}

function push (number) {
if (deepLevel < N) {
xVarArray[ deepLevel ] = number;
deepLevel++;
}
}

function getCurrent () {
return xVarArray[ deepLevel - 1 ];
}

function increaseCurrent () {
xVarArray[ deepLevel - 1 ] = xVarArray[ deepLevel - 1 ] + 1;
}

function pop () {
deepLevel--;
}

function LOOP () {
//initial first Var
push(1);
var needPush = true;
while ( true ) {
if (needPush) push(getCurrent());
var cond = condition();
if (cond === 'match') {
console.log("output xVarArray=> " + xVarArray.slice(0, deepLevel));
increaseCurrent();
needPush = false;
//while loop ended condition weird?
if (xVarArray.slice(0, deepLevel).length === 1) return;
}
else if (cond === 'less') {
needPush = true;
}
else if (cond === 'overflow') {
pop();
increaseCurrent();
needPush = false;
}
}
}

LOOP();
}

function test2 () {
var N = 10;
var deepLevel = 0;
var xVarArray = new Array(N);
//initialization xVarArray to Zero.
for (var idx = 0; idx < N; idx++) {
xVarArray[ idx ] = 0;
}

function condition () {
var sumOfTotal = 0;
for (var i = 0; i < deepLevel; i++) {
sumOfTotal += xVarArray[ i ];
}
if (sumOfTotal === N) return 'match';
else if (sumOfTotal < N) return 'less';
else return 'overflow';
}

//convert Multiple embedded For Loop to recursive Call.
function RC (numStart) {
deepLevel++;
for (var i = numStart; i <= N; i++) {
xVarArray[ deepLevel - 1 ] = i;
var cond = condition();
if (cond === 'match') {
console.log("output xVarArray=> " + xVarArray.slice(0, deepLevel));
}
else if (cond === 'less')
RC(i);
else if (cond === 'overflow') break;
}

deepLevel--;
}

RC(1);
}
</script>

<body>
<button onclick="test1()">Test</button>
</body>
</html>