u011747152的博客

原题:// Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.// Note: The input string may contain letters other than the parentheses ( an

原题:// Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.// Do not allocate extra space for another array, you must do this in place

原题:// Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all meetings.// For example,// Given [[0, 30],[5, 1

原题:// Implement a trie with insert, search, and startsWith methods.// Note:// You may assume that all inputs are consist of lowercase letters a-z.// Your Trie object will be instantiated and called as

原题：// Given an array of strings, group anagrams together.// For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], // Return:// [// ["ate", "eat","tea"],// ["nat","tan"],// ["bat"]/

原题：// Given a nested list of integers, implement an iterator to flatten it.// Each element is either an integer, or a list -- whose elements may also be integers or other lists.// Example 1:// Given t

原题：// A message containing letters from A-Z is being encoded to numbers using the following mapping:// 'A' -> 1// 'B' -> 2// ...// 'Z' -> 26// Given an encoded message containing digits, determine t

原题：// The count-and-say sequence is the sequence of integers beginning as follows:// 1, 11, 21, 1211, 111221, ...// 1 is read off as "one 1" or 11.// 11 is read off as "two 1s" or 21.// 21 is read o

原题：// Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.// Example:// nums = [1, 2, 3]// target = 4/

原题：// Given a rows x cols screen and a sentence represented by a list of non-empty words, find how many times the given sentence can be fitted on the screen.// Note: // A word cannot be split into

趣味题输入一个数字，当它转为二进制时，它含有几个1。并返回。 如:输入1 返回1。因为二进制为1输入2 返回1。因为二进制为10输入3 返回2。 因为二进制为11输入7 返回3。因为二进制为111解法1： public int countBitsToOneBasedOnString(int n) { int result = 0; String binaryNumber

快速排序由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。public abstract class SortingAlgorithm { public abstract voi

原题：/** * Created by gouthamvidyapradhan on 17/03/2017. * Say you have an array for which the ith element is the price of a given stock on day i. * <p> * If you were only permitted to complete at mo

原题：/** * Created by gouthamvidyapradhan on 04/07/2017. * In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to

原题：/** * Created by gouthamvidyapradhan on 01/04/2017. * You are climbing a stair case. It takes n steps to reach to the top. * <p> * Each time you can either climb 1 or 2 steps. In how many distin

原题：/** * Created by gouthamvidyapradhan on 23/06/2017. * You are given coins of different denominations and a total amount of money amount. * Write a function to compute the fewest number of coins

原题：/** * Created by gouthamvidyapradhan on 22/03/2017. * You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make u

原题：/** * Created by gouthamvidyapradhan on 12/06/2017. * Accepted * Given a list of words (without duplicates), please write a program that returns all concatenated words in the given list of words

原题：/** * Created by gouthamvidyapradhan on 01/04/2017. * A message containing letters from A-Z is being encoded to numbers using the following mapping: * <p> * 'A' -> 1 * 'B' -> 2 * ... * 'Z' ->

原题：/** * Created by gouthamvidyapradhan on 12/07/2017. * The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. * The dungeon consists of M x N rooms la

给出一个数组,里面的值代表当日股价，你需要选定最佳的时间买入股票，之后卖出股票。以此来获得最佳利润// Example 1:// Input: [7, 1, 5, 3, 6, 4]// Output: 5// Example 2:// Input: [7, 6, 4, 3, 1]// Output: 0public class Solution { public int maxProf

原题:// Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + nums[j] + nums[k] < target.// For example, g

原题:// Given a binary tree, return all root-to-leaf paths.// For example, given the following binary tree:// 1// / \// 2 3// \// 5// All root-to-leaf paths are:// ["1->2->5", "1->3"]/*

动态规划： 原题：/** * Created by pradhang on 4/3/2017. * You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping

原题：/** * Created by pradhang on 7/11/2017. * After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. * Th

原题：/** * Created by gouthamvidyapradhan on 02/04/2017. * Given an unsorted array of integers, find the length of longest increasing subsequence. * * For example, * Given [10, 9, 2, 5, 3, 7,

原题：/** * Created by gouthamvidyapradhan on 24/02/2017. * Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. * * Example: *

原题：/** * Created by gouthamvidyapradhan on 27/03/2017. * Given an unsorted array of integers, find the length of longest increasing subsequence. * * For example, * Given [10, 9, 2, 5, 3, 7,

趣味题:假设一场聚会有n个人，他们中间可能存在一个名人。名人的定义是在场的人都认识他，而他却不认识所有人。 已知条件: 1.函数knows(a,b)告诉你a是否认识b，返回bool值你要做的事:确定这场聚会是否有名人的存在,如果不存在则return -1答案:public class Solution extends Relation { public int findCelebr

原题：/** * Created by gouthamvidyapradhan on 02/04/2017. * Find the contiguous subarray within an array (containing at least one number) which has the largest product. * * For example, given t

原题：/** * Created by gouthamvidyapradhan on 07/07/2017. * Find the contiguous subarray within an array (containing at least one number) which has the largest sum. * * For example, given the ar

原题：/** * Created by pradhang on 4/3/2017. * Given a string s, partition s such that every substring of the partition is a palindrome. * * Return the minimum cuts needed for a palindrome parti

原题：/** * Created by gouthamvidyapradhan on 19/08/2017. * Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step: * * Copy All:

原题：/** * Created by gouthamvidyapradhan on 07/04/2017. * Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where

原题：/** * Created by gouthamvidyapradhan on 31/03/2017. * Given n, how many structurally unique BST's (binary search trees) that store values 1...n? * * For example, * Given n = 3, there are

原题：/** * Created by gouthamvidyapradhan on 31/03/2017. * Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. * * For example, * Given n

细胞问题: 每个细胞有两种状态:1为活细胞，0为死细胞，对于每个位置都满足如下的条件：如果活细胞周围八个位置的活细胞数少于两个，则该位置活细胞死亡如果活细胞周围八个位置有两个或三个活细胞，则该位置活细胞仍然存活如果活细胞周围八个位置有超过三个活细胞，则该位置活细胞死亡如果死细胞周围正好有三个活细胞，则该位置死细胞复活public class Solution { public voi

// Example 1:// Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].// Example 2:// Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].// This

趣味题给一个没有排序的整数数组,寻找最大的连续值 如[100, 4, 200, 1, 3, 2] ,则最长的数组是[1, 2, 3, 4]，返回值最大长度是4答案:public class Solution { public int longestConsecutive(int[] nums) { int res = 0; HashMap<Integer,

趣味题给一个数组，求最大的连续子数组的和 如数组:[-2,1,-3,4,-1,2,1,-5,4] 则最大的连续子数组[4,-1,2,1] 和为6答案:public class Solution { public int maxSubArray(int[] nums) { int[] dp = new int[nums.length]; dp[0] = nums[