CNoodle

2019年10月9日

[LeetCode] 334. Increasing Triplet Subsequence

摘要： Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such 阅读全文

posted @ 2019-10-09 08:35 CNoodle 阅读(231) 评论(0) 推荐(0)

[LeetCode] 27. Remove Element

摘要： Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed. Sin 阅读全文

posted @ 2019-10-09 08:07 CNoodle 阅读(454) 评论(0) 推荐(0)

[LeetCode] 7. Reverse Integer

摘要： Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-23 阅读全文

posted @ 2019-10-09 00:52 CNoodle 阅读(460) 评论(0) 推荐(0)

[LeetCode] 170. Two Sum III - Data structure design

摘要： Design a data structure that accepts a stream of integers and checks if it has a pair of integers that sum up to a particular value. Implement the Two 阅读全文

posted @ 2019-10-09 00:25 CNoodle 阅读(206) 评论(0) 推荐(0)

2019年10月8日

[LeetCode] 167. Two Sum II - Input array is sorted

摘要： Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific targe 阅读全文

posted @ 2019-10-08 10:33 CNoodle 阅读(188) 评论(0) 推荐(0)

[LeetCode] 1. Two Sum

摘要： Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each inp 阅读全文

posted @ 2019-10-08 10:15 CNoodle 阅读(735) 评论(0) 推荐(0)

Let the code speak for you.

公告