NewCoder1024

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. 对于重复内容顺序的生成，可以采用递归的方式。生成括号部分可以进行递归，…

Merge two sorted linked lists and return it as a new list. The new lists. 使用循环遍历的方式，将两个链表合并成为一个链表。每次合并之前都进行一次比较操作。 Runtime: 0 ms, faster th…

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. Open brackets must b…

Given a linked list, remove the n-th node from the end of list and return its head. Given n will always be valid. 使用两个指针避免回溯的情况，只需要让两个指针保持N…

Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum…

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of …

昨天华为二面的时候碰到了这道题的简化版（两数之和），今天顺序做题的时候就碰到了。不过之前看面经的时候有注意过这个题，所以仔细看看面经是非常重要的。 Given an array nums of n integers, are there elements a, b, c in …

Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string…

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, two is written as II in Roman numeral, just…