![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
镇上村树
这个作者很懒,什么都没留下…
展开
-
LeetCode:1_TwoSum--C++实现
#include <iostream> #include <vector>using namespace std;/* LeetCode 1.TwoSum 题目要求: Given an array of integers, return indices of the two numbers such that they add up to a specific target.原创 2017-10-12 13:58:06 · 270 阅读 · 0 评论 -
LeetCode_2-Add_Two_Numbers
#include <iostream>/* You are given two non-empty linked lists representing two non-negative integers.The digits are stored in reverse order and each of their nodes contain a single digit.Add the two n原创 2017-10-14 09:06:22 · 213 阅读 · 0 评论 -
LeetCode-3_Longest_Substring_Without_Repeating_Characters-C++ Implement
#include <iostream> #include<ext/hash_map> //不写ext应该也是可以的/* 2017年10月14日15:23:32Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", th原创 2017-10-14 16:59:47 · 210 阅读 · 0 评论 -
LeetCode-4_MedianOfTwoSortedArrays-C++
/* 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)).Example 1: nums1 = [1, 3] n原创 2017-10-15 19:35:01 · 188 阅读 · 0 评论 -
LeetCode-5_Longest Palindrome Substring
/* * main.cpp * * Created on: 2017年10月16日 * Author: zhy * * Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. *原创 2017-10-17 11:20:44 · 240 阅读 · 0 评论