摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum 阅读全文

摘要： Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex 阅读全文

摘要： Design and implement a TwoSum class. It should support the following operations:add and find. add - Add the number to an internal data structure.find 阅读全文

摘要： path sum Given a binary tree and a sum,determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example : Given the below the binary ... 阅读全文

摘要： Reverse String Write a function that takes a string as input and returns the string reversed. Example: Given s = "hello", return "olleh" c++ solution1: class solution1: { public: str... 阅读全文

摘要： 1,修改密码ubuntu用户密码 http://blog.itpub.net/9606353/viewspace-2651439/ 阅读全文

摘要： Given a sorted array, remove the duplicates in place such that each element appear only onceand return the new length.Do not allocate extra space for 阅读全文

摘要： Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Example 2: 阅读全文

摘要： Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. An input string is valid if: Op 阅读全文

摘要： 3，手写strcpy,memcpy,memmove函数； 2，线程同步几种方式： 互斥锁，信号量，临界区 1,实现一个vector，是1.5还是2倍？各有什么优缺点： （1）1.5倍优势：可以重用之前分配但是释放的内存； （2）2倍劣势：每次申请的内存都不可以重用； 0，线程安全的单例模式 阅读全文