public class IntegerBreak {
public int integerBreak(int n) {
if (n == 2) {
return 1;
}
if (n == 3) {
return 2;
}
if (n % 3 == 1) {
int p = n / 3;
return (int) Math.pow(3, p - 1) * 4;
}
if (n % 3 == 2) {
int p = n / 3;
return (int) Math.pow(3, p) * 2;
}
int p = n / 3;
return (int) Math.pow(3, p);
}
}
相关推荐
...The number of questions is increasing recently. Here is the classification of all `468` questions. ...I'll keep updating for full summary and better solutions....|-----|---------------- | --------------- |...
================ LeetCode ================动态编程1. Min Cost Climbing Stairs [746]2. Best Time to Buy and Sell Stock [121]3.... Integer Break [343]11. Count Numbers with Unique Digits [357]12. 2-Key
leetcode 530 力扣在线评委 # 问题 ...Integer Break 268. Missing Number 144. Binary Tree Preorder Traversal 2016.06.06 94. Binary Tree Inorder Traversal 318. Maximum Product of Word Length
LinkedList<Integer> ab=new LinkedList(); for(int i=0;i;i++) ab.add(i+1); for(;;){ if(ab.size()==0)break;//结束条件 int i=1; while(i!=M){ ab.add(ab.remove());//如果没有报到M这个数字的人将其从...
String inputLine = in.readLine() a = Integer.valueOf(inputLine).intValue() }catch (Exception exc) { System.out.println("Sorry,please input a number.") return } if (a%2!=0) { System.out.println("Sorry,...
Dim i As Integer Dim layer As MapLayer Dim stats As Statistics Dim class As New ClassBreaksRenderer Dim break As Double Set layer = Map1.Layers("states") Set layer.Renderer = class With class .Symbol...
Integer id = Integer.parseInt(parser.getAttributeValue(0)); currentPerson.setId(id); } if (currentPerson != null) { if ("name".equals(parser.getName())) { String name = ...
i = Integer.valueOf(s).intValue(); tf1.setString(i*0.45359 + ""); } else if(!s.equals("") && tf2.getString().equals("")) { i = Integer.valueOf(s).intValue(); tf2.setString(i*2....
Pascal基本算法整理，学习用很好 ... if pr[i] >=x then break else if x mod pr[i]=0 then exit; prime:=true; end;{prime} 2． 3． 4.求最小生成树 A.Prim算法： procedure prim(v0:integer); .....
一、数论算法 1．求两数的最大公约数 function gcd(a,b:integer):integer; begin if b=0 then gcd:=a else gcd:=gcd (b,a mod b);... if pr>=x then break else if x mod pr=0 then exit; prime:=true; end;{prime}
function ExtractArchive(ArcName: PChar;... Break; if Mode = EXTRACT then Operation := RAR_EXTRACT else Operation := RAR_TEST; PFCode := RARProcessFile(hArcData, Operation, nil, nil);
TimeOut: Integer; EndStr: string = #13#10): string;var bufInfo: TBufChar; i: Integer; strStream: TStringStream; {保存所有的数据} FSocketStream: TWinSocketStream;begin strStream := TStringStream....
case Types.INTEGER: typeInJava = useInteger ? "Integer" : "int"; break; case Types.TIMESTAMP: case Types.BINARY: typeInJava = "Calendar"; break; case Types.DECIMAL: typeInJava = "BigDecimal";...
var i:integer; s:String; DoGetClassMenu:TGetClassMenu; begin for I := 0 to PackageList.Count - 1 do begin s:=PPackageInfo(PackageList.Items[i]).RegClassStr; if Pos(Uppercase(Component.ClassName)...
year=Integer.parseInt(s); if((year%4==0 && year%100!=0)||(year%400==0)) mouth=1; else mouth=0; y=year; for(i=1;i;i++) {if((i%4==0 && i%100!=0)||(i%400==0)) y++;} y=y%7; for(i=1;i;i++){ switch(i)...
if pr[i]>=x then break else if x mod pr[i]=0 then exit; prime:=true; end;{prime} 二、图论算法 1．最小生成树 A.Prim算法： procedure prim(v0:integer); var lowcost,closest:array[1..maxn] of ...
// n = Integer.parseInt(br.readLine()); } catch (Exception ex) { return; } try { Graph g = new Graph(n); g.printg(); g.circuit(); } catch (Exception e) { System.out.println(e....
// break; // } // count += 5; // publishProgress(new Integer(5)); // try { // Thread.sleep(500); // } catch (InterruptedException e) { // e.printStackTrace(); // } // } // return null; // }
Map, Integer> map = new HashMap, Integer>(); map.put("item", 1); int val = map.get("item");12345678910111213 在JDK1.7中，摒弃了Java集合接口的实现类，如：ArrayList、HashSet和HashMap。而是直接采用[]、{...
问题/数组和字符串/13.roman_to_integer.md) [26. Remove Duplicates from Sorted Array](Leetcode Problems/Array and String/26_remove_duplicates_from_sorted_array.md) [（雅虎）139。 Word Break](Leetcode ...