This question already has answers here: Closed 11 years ago. Possible Duplicate: Algorithm to return all combinations of k elements from n
I need to remove all occurrences of a bb style tag from a string.The tags can be 开发者_如何学编程nested, and this is where I am failing.I also need to relocate each tag and contents to the end of the
I need to sort an example XML in a way that all the ShippingPoints are sorted first, then the Cargos according their first ShippingPoint and finally the Transports according to the first ShippingPoint
I have a Java class: BinaryTree< t > that I am filling from a file as follow: E . T - I .. N -. M --
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
I\'m try开发者_StackOverflow中文版ing to write a query using these four simplified tables: Organization
I have an array of objects. Content of each array element can be String, or it can again be another array with strings. Or it can be again array ofarrays that hold strings.
I would like to ask you about a code in P开发者_开发问答ython: class UserDict: def __init__(self, dict=None, **kwargs):
I need help regarding recursive function We have a category table contains category_id,category_name and parent_id:
I have a function to print all of the ternary string combinations from length 0 to length n: void TerString(int len,string input){
加载中,请稍侯......