algorithm-热门标签-allqahome-开发者的问答家园

English 中文(简体)

标签：

的问答

在看到最近的算法问题之后,我回顾一个令人感兴趣的问题,我曾经看到并解决过这个问题,但现在却忘记了解决办法。希望的人可以向我指出正确的方向。

如何改进回溯跟踪算法
原文：How to improve recursive backtracking algorithm

I implemented backtracking based solution for my problem which I specified in my previous post: Packing items into fixed number of bins (Bin is a simple wrapper for vector<int> datatype with ...

每个囚室都是黑色或白色的。设计一个算法,以找到最大分局,从而使所有4个边界均为黑色。
原文：In a square matrix, where each cell is black or white. Design an algorithm to find the max sub-square such that all 4 borders are black

每一个囚室都是黑白的,有固定的矩阵。设计一种算法,以找到最大分局,这样所有4个边界都是黑色的。

木质复杂性与 lo合吗?
原文：logarithmic complexity represented with loop?

只要我看一看,其细致的复杂性就能够作为简单的 lo和精细的复杂性来代表。如何代表部落和原木的复杂性?

尽快在贾瓦古斯塔签署32个集束阵列?
原文：Fastest way to sort 32bit signed integer arrays in JavaScript?

0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0

如何按价值分类级次行
原文：How to sort LevelDB by value

使用平级制存储记录(关键价值),其中钥匙为64倍,价值为两倍。做类比:认为64比值h是客户的独特身份,是客户的双重身份......

动态方案拟订组别
原文：Dynamic programming assembly line scheduling

I am reading about Dynamic programming in Cormen etc book on algorithms. following is text from book Suppose we have motor car factory with two assesmly lines called as line 1 and line 2. We have to ...

我正在寻找一个计算一些力量的算法。 (x^y), x and y are integers . 它必须是复杂的O(log [n])
原文：I am looking for an algorithm that calculates the power of a number. (x^y), x and y are integers . It must be of complexity O(log[n]))

目前,我的最佳努力导致奥洛(log2)的复杂性:

专家:根据限额(min x max)预测数字键盘中的下一个钥匙
原文：Expert: algorithm to predict next key in a numeric keyboard based on limits (min x max)

我试图根据预先确定的限额(权重和最高值)计算在数字键盘上可以使用哪些钥匙的算法。因此,我可以隐藏那些“无法利用”的关键。

a. 更好地算法,以找到若干座标的下一个阵容。
原文：A better algorithm to find the next palindrome of a number string

首先,问题是:

Solving Heuristically Using Greedy Algorithm
原文：Solving Heuristically Using Greedy Algorithm

我对测试审查有一个问题,即要求“以贪 the的方法冷静地解决以下几个问题吗?”

5. Tagumi Algorithm,支持1之多
原文：Tag Cloud Algorithm that Supports 1 Word Frequency

I m looking to make a Tag Cloud in Objective-C, and I m trying to find a good algorithm. I ve tried several, which, at first, seemed to work quite well, but they all had one flaw: if the word with the ...

限制之间出现阵列要素数目的快速途径
原文：Fastest way of putting array elements number of occurrences between limits

例如......

用于增加树木调查分行的高效算法
原文：Most efficient algorithm for adding treeview branches

I have to build add the branches (nodes) to a tree view. I m struggling to determine what the lowest O(n) technique is. My data presents as follows: Id ParentId Value 0 null Bob 1 0 ...