亮仔仔的小屋

1. 快慢指针/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: boo

问题描述：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)).总结大牛的算法如下：假设nums

问题描述：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 i

问题描述：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i

谢谢师兄的推荐，LeetCode点击打开链接很适合来刷题，初步着手做编程练习题，下面是算法题第一题two sum问题的描述：Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices