Easy
柯森锎
92年的小学生
展开
-
LeetCode 14. Longest Common Prefix (easy)
题目描述Write a function to find the longest common prefix string amongst an array of strings.代码class Solution { public: string longestCommonPrefix(vector<string>& strs) { int n_str=strs.size()原创 2016-10-23 16:12:14 · 307 阅读 · 0 评论 -
LeetCode 19. Remove Nth Node From End of List
题目描述Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked原创 2016-11-24 22:14:44 · 450 阅读 · 0 评论