[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 indices exists, return false. Example 2019-10-09 #leetcode #java #javascript #array #selection sort #LIS
[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 [-231, 231 - 1], then return 0. Assume the environment 2019-10-09 #leetcode #java #javascript #math
[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 input would have exactly one solution, and you may not 2019-10-08 #leetcode #java #javascript #array #hashmap #two sum #two pointer