摘要：Thelongest common subsequence(LCS)problemis the problem of finding the longestsubsequencecommon to all sequences in a set of sequences (often just two... 阅读全文

摘要：Given an integer matrix, find a submatrix where the sum of numbers is zero. Your code should return the coordinate of the left-up and right-down numbe... 阅读全文

摘要：Reverse a singly linked list.Thoughts:1.Iterative Method.Loop the linked list, set two pointers, one called"first" to always point to the head of the ... 阅读全文

摘要：Question:Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the st... 阅读全文

摘要：Question:Given an array of sizen, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋times.You may assume tha... 阅读全文