iKun

LeetCode最大数值题意编写一个方法，找出两个数字a和b中最大的那一个。不得使用if-else或其他比较运算符。示例：输入： a = 1, b = 2输出： 2解析可以很简单的取巧直接使用Math.max(a,b)来解决。但是，内部实质还是用到if-else来处理。转换下思路，求最大值可以用如下公示：int sum = a + b;int abs = abs(a -...

题目如下解析本题的特殊之处在于不能使用特殊if ,循环迭代、以及乘法除法。如此一来无法是让我们用递归来做，主要是屏蔽if 这个判断条件，那么如何规避呢？很简单，大多数语言普遍支持的&& 短路，有着跟||类似的特性，前面为false，后面不再执行。func sumNums(n int) int { var f func(k int,ret *int) bool ...

In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo’s attacking ascending time series towards Ashe and the poisoning tim...

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies:Si % Sj = 0 or Sj % Si = 0.If there are multiple solutions, retu...

373. Find K Pairs with Smallest SumsYou are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.Define a pair (u,v) which consists of one element from the first array...

284.Peeking Iterator题目描述：Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation – it essentially peek() at the...

Delete Operation for Two StringsGiven two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either ...

Wiggle SubsequenceA sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exis...

Decoded String at IndexAn encoded string S is given. To find and write the decoded string to a tape, the encoded string is read one character at a time and the following steps are taken:If the c...

Given an absolute path for a file (Unix-style), simplify it. For example, path = "/home/", => "/home" path = "/a/./b/../../c/", => "/c" Corner Cases: Did you consider the case ...

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?解析：台阶问题，每次可以走一步或者两部，问第n个...

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. 题解：通过数组中的元素进行组合，满足和等于target。每个元素可以重复利用。...

Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. 解法1：Bit Manipulation （位运算） 将数组中的元素下标构...

Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.解析： 大概意思是找出m,n 二进制表示数的最高位相同的位数11001 11010 11011 11100 结果...

Given a binary tree rooted at root, the depth of each node is the shortest distance to the root.A node is deepest if it has the largest depth possible among any node in the entire tree.The subtree...

Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Input: root = [4,2,6,1,3,null,null]Output: 1Expl...

X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X.  Each digit must be rotated - we cannot choose to leave it alone.A number...

这个道题的大意是：输入一个目标串：s ,以及一个匹配串：p，进行如下规则的匹配： 如果p中存在?，则可以匹配s中任意一个单个字符 如果p中存在*，则可以匹配s中任意一串连续的序列，包括空字符解法一：双指针 给定两个指针pIndex，sIndex。一个遍历p一个遍历s。当我们遍历时，会遇见如下的情况：当s[pIndex] == s[sIndex] 或者 ...