LeetCode OJ
文章平均质量分 70
helenandyoyo
这个作者很懒,什么都没留下…
展开
-
LeetCode OJ——Word Break
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"原创 2014-07-19 16:30:08 · 576 阅读 · 0 评论 -
LeetCode OJ : Single Number II
题目: 我的代码:class Solution {public: int singleNumber(vector<int>& nums) { vector<int>::size_type i = 0, j = 0, k = 0; vector<int> repeat_elem; bool Is_repeat; int te原创 2015-11-02 11:07:34 · 457 阅读 · 0 评论 -
LeetCode OJ: Remove Linked List Elements
题目: 代码:/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListN原创 2015-11-19 11:27:08 · 590 阅读 · 0 评论 -
Leet Code OJ: Valid Number
题目: 补充:true: .1 3. 46.e3 +.8 false: .e1 0e 0.e我的代码class Solution {public: bool isNumber(string s) { //去除首尾空格 size_t first_i = 0, last_i = s.length(); whil原创 2015-11-02 16:55:02 · 391 阅读 · 0 评论 -
LeetCode OJ——Merge Two Sorted Lists
题目: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.代码:/** * Definition for singly-linked list. * struct原创 2015-12-13 16:30:17 · 369 阅读 · 0 评论 -
LeetCode OJ——Submission Details
题目:方法一:递归代码:// Definition for a binary tree node. //struct TreeNode { // int val; // TreeNode *left; // TreeNode *right; // TreeNode(int x) : val(x), left(NULL), right(NULL) {}原创 2015-12-13 19:23:03 · 309 阅读 · 0 评论 -
LeetCode OJ——Implement Trie (Prefix Tree)
哈希表哈希函数: 希望不经过任何比较,一次存取便能得到所查记录,那就必须在记录的存储位置和它的关键字之间建立一个确定的对应关系f,使每个关键字和结构中一个唯一的存储位置相对应,在查找关键字K对应的值时,只需找到f(k)即可。该f 即可成为哈希(hash)函数。冲突:即当关键字key1 != key2, 而f(key1) == f(key2), 则称具有相同函数值得关键字对该哈希函数来说乘坐同义原创 2015-12-14 20:02:32 · 386 阅读 · 0 评论 -
LeetCodeOJ——Word Search
题目: Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically原创 2015-11-29 16:54:46 · 315 阅读 · 0 评论 -
LeetCode OJ——Median of Two Sorted Arrays
题目: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).代码:class Solution {publi原创 2015-11-29 19:09:50 · 337 阅读 · 0 评论 -
LeetCode OJ——Basic Calculator
题目: Implement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty原创 2015-12-01 10:47:10 · 297 阅读 · 0 评论 -
LeetCode OJ——Rotate Image
题目: You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up: Could you do this in-place?代码:class Solution {public: void rotate(vector<vector<i原创 2015-12-05 19:08:00 · 351 阅读 · 0 评论 -
LeetCode OJ——Best Time to Buy and Sell Stock
题目: Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2015-12-06 16:32:12 · 303 阅读 · 0 评论 -
LeetCode OJ——Submission Details
题目:Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. Assume that the total area原创 2015-11-22 21:54:13 · 367 阅读 · 0 评论 -
LeetCode OJ——Isomorphic Strings
题目: 代码:class Solution {public: bool isIsomorphic(string s, string t) { map<char, char> t_s, s_t; for(unsigned int i=0; i<s.length(); i++) { if(t_s.count(t[i])原创 2015-11-22 19:46:53 · 373 阅读 · 0 评论 -
C++编程学习之LeetCode OJ
Insertion Sort List :Sort a linked list using insertion sort.原创 2014-06-26 14:15:26 · 488 阅读 · 0 评论 -
C++编程学习之LeetCode OJ
Binary Tree Postorder Traversal:For example:Given binary tree {1,#,2,3},1\2/3return [3,2,1].原创 2014-07-01 15:28:35 · 503 阅读 · 0 评论 -
C++编程学习之LeetCode OJ
LeetCode OJ:Max Points on a Line Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.原创 2014-06-19 19:44:24 · 592 阅读 · 0 评论 -
C++编程学习之leetCode OJ
Reorder List :Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}原创 2014-07-10 15:58:01 · 504 阅读 · 0 评论 -
c++编程学习
LeetCode OJ:Evaluate Reverse Polish NotationValid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples:["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9原创 2014-06-17 20:20:56 · 504 阅读 · 0 评论 -
C++编程学习之LeetCode OJ
LRU Cache :Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) o原创 2014-06-30 14:52:00 · 475 阅读 · 0 评论 -
C++编程学习
LeetCode:Given an input string, reverse the string word by word. For example,Given s = "the sky is blue",return "blue is sky the".#include#includeusing namespace std;class Solution{public原创 2014-06-17 11:04:12 · 571 阅读 · 0 评论 -
C++编程学习之LeetCode OJ
Sort List:Sort a linked list in O(n log n) time using constant space complexity.参考:http://blog.csdn.net/jiadebin890724/article/details/21334059http://blog.csdn.net/worldwindjp/article/details/18原创 2014-06-25 18:30:56 · 457 阅读 · 0 评论 -
LeetCode OJ:Group Anagrams
题目: 我的代码:class Solution {public: vector<vector<string>> groupAnagrams(vector<string>& strs) { vector<string> list; vector<vector<string>> group_list; vector<string>::size_t原创 2015-11-03 19:38:05 · 393 阅读 · 0 评论 -
LeetCode OJ ——Find Minimum in Rotated Sorted Array
题目: 代码:class Solution {public: int findMin(vector<int>& nums) { int left, right, medium; left = 1; //区间下标从1~nums.size() right = nums.size(); medium = (nums.size(原创 2015-11-22 15:06:32 · 295 阅读 · 0 评论 -
LeetCode OJ——Generate Parentheses
题目: 代码:class Solution {public: vector<string> generateParenthesis(int n) { vector<string> vec; string s; fun(vec, s, n, n); return vec; } bool fun(vector<st原创 2015-11-22 15:30:19 · 343 阅读 · 0 评论 -
LeetCode OJ——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代码:class Solution {public: ListNo原创 2015-12-07 12:27:45 · 351 阅读 · 0 评论