LintCode
acceptedwwh
当代大学生,阳光开朗,乐于交往和求知!
展开
-
合并排序数组
合并两个排序的整数数组A和B变成一个新的数组。给出A=[1,2,3,4],B=[2,4,5,6],返回 [1,2,2,3,4,4,5,6]#include <iostream>#include <cstdio>#include <cstdlib>#include <string>#include <cstring>#include <vector>using namespace std;c原创 2017-01-12 19:20:06 · 330 阅读 · 0 评论 -
[leetcode111].Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.#include <iostream>#include <cstdio>#incl原创 2017-01-19 20:17:23 · 308 阅读 · 0 评论 -
[LeetCode] Longest Substring Without Repeating Characters
question: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length原创 2017-02-14 19:47:22 · 231 阅读 · 0 评论 -
leetcode 192. Word Frequency
题目: 192. Word Frequency 解答:cat words.txt | tr -s ' ' '\n' | sort | uniq -c | sort -r | awk '{ print $2, $1 }'tr -s: truncate(缩短) the string with target string, but only remaining one instance (e.g. mu翻译 2017-06-09 17:10:33 · 811 阅读 · 0 评论