MCPcopy Create free account

hub / github.com/codingXiaxw/leetcode / functions

Functions31 in github.com/codingXiaxw/leetcode

↓ 2 callersMethodreverse
(int x)
algorithms/Java/reverse.java:13
↓ 1 callersMethodaddBinary
carry用于纪录超过该位数字超过2的,向前进1 @param a @param b @return
algorithms/Java/addBinary.java:32
↓ 1 callersMethodclimbStairs
(int n)
algorithms/Java/climbingStairs.java:36
↓ 1 callersMethodisPalindrome
(int x)
algorithms/Java/palindromeNumber.java:46
↓ 1 callersMethodisValid
(String s)
algorithms/Java/validParentheses.java:18
↓ 1 callersMethodlengthOfLastWord
(String s)
algorithms/Java/lengthOfLastWord.java:20
↓ 1 callersMethodlongestCommonPrefix
(String[] strs)
algorithms/Java/longestCommonPrefix.java:23
↓ 1 callersMethodremoveDuplicates
(int[] nums)
algorithms/Java/removeDuplicatesFromSortedArray.java:20
↓ 1 callersMethodremoveElement
(int[] A, int elem)
algorithms/Java/removeElement.java:31
↓ 1 callersMethodromanToInt
(String s)
algorithms/Java/romanToInteger.java:22
↓ 1 callersMethodsearchInsert
(int[] nums, int target)
algorithms/Java/searchInsertPosition.java:16
↓ 1 callersMethodstrStr
(String haystack, String needle)
algorithms/Java/implementStrStr.java:21
↓ 1 callersMethodtwoSum
(int[] numbers, int target)
algorithms/Java/two_sum.java:17
MethodlengthOfLongestSubstring
(String s)
algorithms/Java/LongestSubstringWithoutRepeatingCharacters.java:8
Methodmain
Total Accepted: 153092 Total Submissions: 394417 Difficulty: Easy Contributors: Admin You are climbing a stair case. It takes n st
algorithms/Java/climbingStairs.java:18
Methodmain
(String[] args)
algorithms/Java/palindromeNumber.java:39
Methodmain
(String[] args)
algorithms/Java/reverse.java:6
Methodmain
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array
algorithms/Java/removeElement.java:26
Methodmain
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.
algorithms/Java/countAndSay.java:18
Methodmain
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the
algorithms/Java/validParentheses.java:13
Methodmain
Write a function to find the longest common prefix string amongst an array of strings. 写一个函数来查找字符串数组中最长的公共前缀字符串。 @param args
algorithms/Java/longestCommonPrefix.java:11
Methodmain
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 fo
algorithms/Java/removeDuplicatesFromSortedArray.java:14
Methodmain
mplement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 返回needle在haystack中第一次出现的下
algorithms/Java/implementStrStr.java:14
Methodmain
(String[] args)
algorithms/Java/two_sum.java:8
Methodmain
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or
algorithms/Java/searchInsertPosition.java:12
Methodmain
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough spa
algorithms/Java/mergeSortedArray.java:16
Methodmain
罗马数字共有7个,即Ⅰ(1)、Ⅴ(5)、Ⅹ(10)、Ⅼ(50)、Ⅽ(100)、Ⅾ(500)和Ⅿ(1000)。按照下述的规则可以表示任意正整数。需要注意的是罗马数字中没有“0”,与进位制无关。一般认为罗马数字只用来记数,而不作演算。 重复数次:一个罗马数字重复几次,就表示这个数的几倍。 右加左减: 在
algorithms/Java/romanToInteger.java:18
Methodmain
Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". @param args 即二进制的
algorithms/Java/addBinary.java:18
Methodmain
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word
algorithms/Java/lengthOfLastWord.java:12
Methodmerge
(int[] A, int m, int[] B, int n)
algorithms/Java/mergeSortedArray.java:22
MethodmySqrt
(int x)
algorithms/Java/sqrt.java:16