data structures - How to check the symmetry of an integer singly-linked list in C++? -

-

I have a question about a single-linked list in C ++.

An integer array is called [0 .. n] symmetric if array [0] = array [n], array [1] = array [n -1], ...

For example: 1 2 3 4 5 4 3 2 1

So, is there a way to check the symmetry of an integer single-linked list?

I have thought of copying their value under an array, then check the symmetry this array but I think it is not good because the hidden things in the links list will be lost.

The way in the classic fold and press the elements halfway on a stack, then from the stack Pop and compare the remaining elements. 

  bool isPalindrome (forward_list & lt; int & gt; & amp; l) {forward_list & lt; Integer & gt; Pile; Auto = l.begin (); Int len ​​= 0; Int i = 0; While (this! = L.end ()) {++ len; This ++; } If (lane and lieutenant; = 1) are true; This = l.begin (); While (i & lt; (lane / 2)) {stack.push_front (* it); ++ i; This ++; } If ((lane% 2) == 1) ++; While (! Stack.empty ()) {if (stack.front (!)! = * It) false return; Stack.pop_front (); This ++; } Back true; } Bool test_good (const int i) {int j = i / 2; Forward_list & lt; Integer & gt; L; For (int k = 0; k & lt; j; k ++) {l.push_front (k); } If (i% 2 == 1) {l.push_front (j); } For (int k = j-1; k> = 0; k -) {l.push_front (k); } Refunded iPandrom (L); } Bool test_bad (const int i) {forward_list & lt; Int & gt; L; For (int k = 0; k & lt; i; k ++) {l.push_front (k); } L.push_front (i); L.push_front (i + 1); Come back! IPalmel (L); } Int main () {for (int i = 0; i & lt; 20; i ++) {cout & lt; & Lt; "Exam for" & lt; & Lt; I & lt; & Lt; "..."; If (test_good (i)) cout & lt; & Lt; "Fine..."; And I come back; If (test_bad (i)) cout & lt; & Lt; "Fine." & Lt; & Lt; Endl; And I come back; } Return 0; }

I used forward_list to apply a stack instead of using a dedicated std :: stack template. Besides, note that the problem is complex when using the generic lists of T , because you do not want to instantize the values ​​in the list, while pressing the stack, Can not push primitive types (such as char or int ) for that problem, you have to provide two different templated implementations, according to T according to enable_if ed. You might also add a comparison operator to the template.


Comments

Post a Comment

Popular posts from this blog

mysql - How to enter php data into a html multiple select box -

-
I am working on a page that will create a team. I just want to create a selection box which will list all the users of all the users. After that, the user can select more than one friend (i.e. 5) and can send the request to these 5 people to join the team but I am having problems I did this: Select $ sql = "Select i. *, Join * Connect with M * m.id = i.clique_id where adder_id =: id"; $ Stmt = $ db- & gt; Query ($ sql, array ('id' = & gt; $ _SESSION ['id'])); While ($ record = $ stmt-> fetch ()) {$ surname = $ record ['surname']; } and this: & lt; Select multiple = "true" name = "category" well id = "category" name = "category" category = "" & gt; & Lt; Option value = "& lt ;? php echo $ surname ;? & gt;" & Gt; & Lt ;? Php ek $ nickname; ? & Gt; & Lt; / Options & gt; & Lt; / Select & gt; But only a friend's nickname...
Read more

java - Can't add JTree to JPanel of a JInternalFrame -

-
Image
There are two panels in my JInternalframe. I want to add TopPanel to Jtree to nominate another. But I can not add Jaitari to the top of the panel. Please help me in this piece of code: DefaultMutableTreeNode root = new DefaultMutableTreeNode ("deck"); DefaultMutableTreeNode Item Clubs = New DefaultMutableTreeNode ("Club"); AddAllCard (itemClubs); Root.add (itemClubs); DefaultMutableTreeNode item = New DefaultMutableTreeNode ("Diamonds"); AddAllCard (itemDiamonds); Root.add (itemDiamonds); DefaultMutableTreeNode Itemspads = New DefaultMutableTreeNode ("Spades"); AddAllCard (itemSpades); Root.add (itemSpades); DefaultMutableTreeNode item increases = new DefaultMutableTreeNode ("heart"); AddAllCard (itemHearts); Root.add (itemHearts); Default Trimodel Tree Model = New DefaultTreeModel (Route); Tree = new jetty (tree modal); ScrollPane = new JScrollPane (tree); // scrollPane.setViewportView (tree); . ScrollPane.getViewport () add (tr...
Read more

c++ - Cassandra datastax cpp driver - avoiding unnecessary copies -

-
I use the following method to create my insert statement for Cassandra (using datastax cpp driver) : ssStmt1 & lt; & Lt; "Insert some table (...) value (....)" string sStatement1 = ssStmt1.str (); Castestring cass1 = cass_string_init (sStatement1.c_str ()); CassStatement * pStmt1 = cass_statement_new (cass1, 0); I have also tried the following: CassString cass1 = cass_string_init ("Enter some table (id, date, c) value (? ,?,?); "); CassStatement * pStmt1 = cass_statement_new (cass1, 3); Cass_statement_bind_uuid (pStmt1, 0, uuidKey); Cass_statement_bind_int64 (PSTMT1, 1, timestamp); Cass_statement_bind_string (pStmt1, 2, sSomething); The first pattern works with mixed keys, the second is not. The key has a timestamp and a UUID. Timestamp is one of two errors in the field (based on the used bond statement). If bound in this way: cass_statement_bind_int64_by_name (pStmt1, "date", timestamp); I get the following error: Inva...
Read more