两个数组里找两个相加和为N的组合(答案只有一个)

题目：在两个数组中找两个相加和为N的组合，答案只有一个暴力O（n*m）使用辅助数组保存sum-b[i]的值,优化到O(n+m) #include int sum, m, n;int a[100], b[100]; int main(){ int c[100];

Generate-parentheses

12345678/* * Given n pairs of parentheses, write a function to generate all combinations * of well-formed parentheses. * For example, given

1234/* * Write a function to find the longest common prefix string amongst an array * of strings. */ 求多个字符串的最长公共前缀。 123456789101112131415

题目：输入n代表个数，将他们排列成一排使组合出来的数最大例如：2121 12 12121 //a + b > b + a ? a + b : b + a; 1234567891011121314151617181920212223242526272829303132

按虚线的方向将相乘的结果相加（虚线上的横纵坐标和为i+J） 1234567891011121314151617181920212223242526272829303132333435363738394041424344#include <iostream>#incl

123456789101112131415161718192021222324252627282930313233343536373839404142#include <cstdio>#include <cstring>#include <iostr

123456789101112131415161718192021222324252627282930313233343536373839/* * Given a roman numeral, convert it to an integer. * Input is guaran

12345678910111213141516171819202122232425/* * Given an integer, convert it to a roman numeral. * Input is guaranteed to be within the range

123456789/* * Given n non-negative integers a1, a2, ..., an, where each represents a point * at coordinate (i, ai). n vertical lines are dr

12345678910111213141516/* * Determine whether an integer is a palindrome. Do this without extra space. * Some hints: * Could negative intege