Leecode
文章平均质量分 52
qq_35923783
这个作者很懒,什么都没留下…
展开
-
Leecode Week1: Two Sum
Week1:Two Sum 1. Question Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution,原创 2017-09-11 10:48:55 · 189 阅读 · 0 评论 -
Leecode Week16: Search for a Range
Week16: Search for a RangeDifficulty:Medium1.ProblemGiven an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexi原创 2018-01-05 16:51:38 · 134 阅读 · 0 评论 -
Leecode Week15: Search in Rotated Sorted Array
Week 15: Search in Rotated Sorted ArrayDifficulty:Medium1.ProblemSuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7原创 2018-01-05 11:34:39 · 153 阅读 · 0 评论 -
Leecode Week13: Swap Nodes in Pairs
Week13: Swap Nodes in Pairs Difficulty:Medium 1.Problem Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->原创 2018-01-04 17:12:11 · 139 阅读 · 0 评论 -
Leecode Week14: Divide Two Integers
Week14: Divide Two Integers Difficulty:Medium 1.Problem Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 2.Algorithm 1.首先判断div原创 2018-01-04 20:22:53 · 226 阅读 · 0 评论 -
Leecode Week12: Generate Parentheses
Leecode原创 2018-01-04 16:21:02 · 230 阅读 · 0 评论 -
Leecode Week11: Remove Nth Node From End of List
Leecode原创 2018-01-04 12:46:13 · 204 阅读 · 0 评论 -
Leecode Week10: 4Sum
Leecode原创 2018-01-04 12:42:03 · 185 阅读 · 0 评论 -
Leecode Week9: Letter Combinations of a Phone Number
Week9: Letter Combinations of a Phone Number Difficulty:Medium 1.Problem Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to lett原创 2018-01-04 01:42:30 · 143 阅读 · 0 评论 -
Leecode Week8: 3Sum Closest
Week8: 3Sum Closest Difficulty:Medium 1.Problem Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three intege原创 2018-01-04 00:29:23 · 148 阅读 · 0 评论 -
Leecode Week7: 3Sum
Week7: 3Sum Difficulty:Medium 1.Problem 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.原创 2018-01-04 00:02:42 · 171 阅读 · 0 评论 -
Leecode Week6: Container With Most Water
Week6: Container With Most Water Difficulty:Medium 1.Problem Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that原创 2018-01-03 20:25:47 · 157 阅读 · 0 评论 -
Leecode Week5: ZigZag Conversion
Week5: ZigZag Conversion Difficulty:Medium 1.Question The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fi原创 2018-01-03 19:23:22 · 148 阅读 · 0 评论 -
Leecode Week4: Longest Palindromic Substring
Week4:Longest Palindromic Substring Difficulty:Medium 1.Question Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: In原创 2018-01-03 17:13:57 · 145 阅读 · 0 评论 -
Leecode Week3: Longest Substring Without Repeating Characters
Week3:Longest Substring Without Repeating Characters Difficulty:Medium 1.Question Given a string, find the length of the longest substring without repeating characters. Examples: Given “ab原创 2018-01-03 15:37:16 · 144 阅读 · 0 评论 -
Leecode Week2: Add Two Numbers
Week2:Add Two Numbers(Medium) 1. Question 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原创 2017-09-18 17:53:03 · 325 阅读 · 0 评论 -
系统分析与设计hw3
系统分析与设计hw3这几周学习了一下javascript,以学习笔记作为技术报告:JavaScript学习笔记1.数据类型和变量数据类型:Number、字符串、布尔值变量声明使用var,因为js是动态语言比较运算符:===的使用,此运算符不会做自动类型转换,而==则会。一般用===;NaN和所有值比较都不相等,包括它自己。唯一判断方法为isNaN;浮点数之间的相等比较只能用Math.abs(1/3-原创 2018-04-15 23:54:12 · 229 阅读 · 0 评论