futura medium

Calculate the a^n% b where a, B and n is all 32bit integers.For 2^31% 3 = 2For 100^1000% 1000 = 0This question has a noticeable problem, when n is odd, if the recursion is written as:Long num = Fastpower (A, B, N/2);return (int) ((A%B * num * num)% B);This will overflow in some test cases, so it is best to write the following formclassSolution {/** @param A, B, n:32bit integers * @return: an integer*/ Public intFastpower (intAintBintN) {//Write your code hereA%=b; if(n = = 0) ret

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.Given n = 3 , a solution set is:"((()))", "(()())", "(())()", "()(())", "()()()" Public classSolution {/** * @paramn N Pairs *@returnAll combinations of well-formed parentheses*/ PublicArraylistintN) {//Write Your code hereArrayListNewArraylist(); if(n ) returnresult; StringBuilder Line=NewStringBuilder (); Helper (result, line,0, 0, N); returnresult; } Public voidHel

Count the number of K ' s between 0 and N. K can be 0-9.If n=12, k=1 in [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ten, one,], we have FIVE 1 ' s(1, ten, one, one)classSolution {/** param k:as description. * param n:as description. * Return:an integer denote the count of digit K in 1..N*/ Public intDigitcounts (intKintN) {//Write your code here intCount = 0; for(inti = k; I ) {Count+=Singlecount (i, k); } returncount; } Public intSinglecount (intNumintk) {

Given-integers n and K, return all possible combinations of K numbers out of 1 ... n.For example,If N = 4 and k = 2, a solution is:[[2,4],[3,4],[2,3],[1,2],[1,3],[1,4]]The idea is still the same, backtracking algorithm, just a little bit of a judgment condition. Public classSolution {/** * @paramN:given the range of numbers *@paramK:given The numbers of combinations *@return: All the combinations of K numbers out of 1..N*/ PublicListintNintk) {//Write your code hereListNewArraylist(); if

Given A collection of candidate numbers (C) and a target number (T), find all unique combinations in cwhere the candidate numbers sums to T. Each number in C is used once in the combination.Notice All numbers (including target) would be positive integers. Elements in a combination (A1, A2, ..., AK) must is in non-descending order. (ie, a1≤a2≤ ... ≤ak). The solution set must not contain duplicate combinations. Given candidate set [10,1,6,7,2,1,5] and target

); - if(ans = =NULL) the { *Ans =value; $ }Panax Notoginseng - if(Point! =NULL) the { +Point->next =value; A } thePoint =value; + -L1 = l1->Next; $L2 = l2->Next; $ } - - while(L1! =NULL) the { -sum = carry + l1->Val;Wuyicarry = SUM/Ten; thesum = sum%Ten; -ListNode *value =Newlistnode (sum); WuPoint->next =value; -Point =value; About $L1 = l1->Next; -

Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree was defined as a binary tree in which the depth of the Every node never differ by more than 1.Given binary Tree a= {3,9,20,#,#,15,7} , b={3,#,20,15,7}A) 3 B) 3 /\ 9 / \ / 7 7The binary tree A is a height-balanced binary tree, but B is not./*** Definition of TreeNode: * public class TreeNode {* public int val; * Public TreeNode left, ri

Occurs when the project uses the AppScan scan:650) this.width=650; "src=" Http://s2.51cto.com/wyfs02/M02/80/42/wKiom1c8HI2CSEHPAACvu5RATtI383.png "title=" 3.png " alt= "Wkiom1c8hi2csehpaacvu5ratti383.png"/>Processing method:Open the project's Web. config file and add it under httpcookies httponlycookies="true"requireSSL="true"/>Note that after adding the parameter, if you continue to use HTTP to access, such as login needs to use cookies, then this time is not normal to read the cookie 3. Modify

The code base version is a integer start from 1 to N. One day, someone committed a bad version in the code case, so it caused this version and the following versions is all FA iled in the unit tests. Find the first bad version.Determine which version is the first bad one isBadVersion . The details interface can be found in the code ' s annotation part.Given n = 5 :isBadVersion(3) -> falseisBadVersion(5) -> trueisBadVersion(4) -> trueHere we were 100% sure that the 4th version was the first bad v

There is a integer array which has the following features: The numbers in adjacent positions is different. A[0] We define a position P is a peek if:A[P] > A[P-1] A[P] > A[P+1]Find a peak element in the this array. Return the index of the peak.Given[1, 2, 1, 3, 4, 5, 7, 6]Return index 1 (which is number 2) or 6 (which is number 7)classSolution {/** * @parama:an integers array. * @return: Return any of peek positions. */ Public intFindpeak (int[] A) {//Write your code h

Divide-integers without using multiplication, division and mod operator.If It is overflow, return2147483647Given dividend = 100 and divisor = 9 , return 11 . Public classSolution {/** * @paramDividend The dividend *@paramdivisor the divisor *@returnThe result*/ Public intDivideintDividend,intdivisor) { //Write Your code here if(Divisor = = 0) return2147483647; if(Dividend = = 0) return0; if(Divisor = = 1) returndividend; if(Dividend

: Find how many characters in the beginning of a string str1 are characters that belong to the string str2function return: Returns the number of characters in the string str2 that are returned by the str1 at the beginning.Parameter description: STR1 is the lookup string, str2 is the string to find15. Function Name: strstrfunction prototypes: int strspn (const char *str1,const char *STR2)function function: Finds characters in string str1 that match exactly the characters in the STR2The function r

as an XML file, Next to the interface in the Catalog file, select the XML file, and then description fill in a nameThen, when you create a MAVEN project, you can select this directly, and when you choose, the contents of the native XML will be read directly, much faster than the Internet access.Finally give a little trick:Sometimes, in the unit's LAN Architecture Nexus Server, the server does not have access to the external network, so that can not be downloaded from the Internet through the Ag

/functionsIf [$#-ne 2];thenecho "At least input-argus:"Exit 1FiFor I in 12 13DoSCP-P22-RP $ [email protected] $i: ~ >/dev/null 2>1ssh-p22-t [email protected] $i SUDO/BIN/CP ~/$file $remotefile >/dev/nullIf [$?-eq 0];thenAction "SCP $file to $remotefile is OK"/bin/trueElseAction "SCP $file to $remotefile is failed"/bin/falseFidone , N Bsp , NB Sp , NB Sp , NB Sp , NB Sp , NB Sp

Permutations (the full permutation problem-the classic of backtracking)Given A collection of distinct numbers, return all possible permutations.For example,[1,2,3]The following permutations:[[1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]The main idea: to find a sequence of the full array.Train of thought: When doing the permutation combination, the simulation of the process to get ideas. First select one of the elements in the collection as the first bit, then select an element in the remaining el

Given A string S , find the longest palindromic substring in S . The maximum length S of is assume, and there exists one unique longest palindromic substring.ExampleGiven the string = "abcdzdcab" , return "cdzdc" .ChallengeO (N2) time is acceptable. Can do it in O (n) time.N^2 procedure: Public classSolution {/** * @params Input String *@returnThe longest palindromic substring*/ Publicstring Longestpalindrome (string s) {//Write Your code here if(s = =NULL|| S.length () = = 0)

is considered to be index, delete } } returncount==N; }}2.DFSThe pre must be recorded in DFS to avoid a->b->a such traversal, which is considered a loop.classSolution { Public BooleanValidtree (intNint[] edges) { if(n==0)return false; List[] List=NewList[n]; for(inti=0;i) {List[i]=NewArraylist(); } for(int[] pair:edges) {list[pair[0]].add (pair[1]); list[pair[1]].add (pair[0]); } Boolean[] visited=New Boolean[n]; if(Dfs (list, visited, 0,-1))retur

and N;(1) Termination criteria: X and Y are invalid, the currently moving character is not the next character of the string;(2) Returns True if the end of the matching string has been reached(3) Temporarily replace the current movement to the coordinate character ' ", because to make a mark, so as not to repeat the reentry movement;(4) Call 4 recursive functions, respectively moving to the top and bottom around the current motion character, and determine;(5) If 4 recursive functions are false,

---restore content starts---Given a list of integers, which denote a permutation.Find the next permutation in ascending order.NoticeThe list may contains duplicate integers.Example[1,3,2,3]for, the next permutation is[1,3,3,2][4,3,2,1]for, the next permutation is[1,2,3,4] Public classSolution {/** * @paramnums:an array of integers *@return: Return Nothing (void), does not return anything, modify Nums in-place instead*/ Public int[] Nextpermutation (int[] nums) { //Write your code

Given an array of integers and a number k, the majority number is the number of the occurs of the size of the more than 1/k array.Find it.NoticeThere is a majority number in the array.ExampleGiven [3,1,2,3,2,3,3,4,4,4] k=3 and, return 3 .ChallengeO (n) time and O (k) Extra space Public classSolution {/** * @paramnums:a List of integers *@paramK:as described *@return: The majority number*/ Public intMajoritynumber (arraylistintk) {//Write your code if(Nums = =NULL|| Nums.si