C++
文章平均质量分 63
Rijkstra
对所做的事情的理解越深,就会做的越好。
展开
-
【C++】只为熟悉语言的一个小小练习
原题是C++ Primer()上的习题6.12原创 2014-08-22 12:27:09 · 554 阅读 · 0 评论 -
【leetcode】Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.思路:将链表尾部和头部连起来,顺便算出链表长度len计算k原创 2016-06-02 21:36:50 · 360 阅读 · 0 评论 -
【leetcode】Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "原创 2016-06-02 21:29:45 · 353 阅读 · 0 评论 -
【leetcode】Minimum Window Substring
class Solution {public: string minWindow(string s, string t) { vector dict(128, 0); for (auto c : t) ++dict[c]; int counter = t.size(); int begin =原创 2016-06-02 13:49:47 · 456 阅读 · 0 评论 -
【leetcode】Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements.For example,Given [1,1,1,2,2,3] and k = 2, return [1,2].Note: You may assume k is always valid, 1 ≤ k ≤ number原创 2016-05-31 11:53:12 · 331 阅读 · 0 评论 -
【leetcode】Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2015-11-19 21:39:03 · 318 阅读 · 0 评论 -
【leetcode】Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O原创 2015-11-19 21:17:01 · 323 阅读 · 0 评论 -
【leetcode】Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on原创 2015-11-19 20:35:43 · 408 阅读 · 0 评论 -
【leetcode】Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given原创 2015-11-19 20:01:49 · 385 阅读 · 0 评论 -
【C++】非递归求二叉树的前序和中序序列
Keyword:stack前序:/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right原创 2015-11-23 22:08:19 · 522 阅读 · 0 评论 -
【C++】CLRS上的堆排序实现
N天前照着书上伪代码写的堆排序原创 2014-10-07 11:43:08 · 523 阅读 · 0 评论 -
【C++】Primer 9.39
#include #include #include #include //EXIT_SUCCESS, FAILUREusing namespace std;int main(){ string line1 = "We were her pride of 10 she named us:"; string line2 = "Benjamin, Phoneix, the Pr原创 2014-09-15 22:12:49 · 655 阅读 · 0 评论 -
【C++】两个关于vector和iterator的练习
在VC6.0里编译会出现4个warningstring容器,所有字母换成大写:原创 2014-08-11 20:13:11 · 696 阅读 · 0 评论 -
【leetcode】3Sum, 3Sum Closest
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c原创 2016-06-03 20:42:31 · 367 阅读 · 0 评论