給定多項式A(x)
輸出多項式x*A(x)
herrDeng網內搜尋
自訂搜尋
Ads
訂閱:
張貼留言 (Atom)
熱門文章
-
連續複利
-
請用Random產生20個0~99的奇數(可重複),然後排序
-
C++ Py3 計數排序與partial sum解Leetcode 2300 Successful Pairs of Spells and Potions Portions的極大值小於等於10萬是可進行記數排序的關鍵,既然可以採用記數排序,後面的二元搜尋也可以透過part...
-
輸入公元n年,輸出"平年" "閏年"
-
Py3 C++ C 2pointer速解Leetcode 11Container With Most Water [Py3 code請進]
-
Py3 C++計數bitmask與2 pointers速解Leetcode2273 Find Resultant Array After Removing Anagrams 字串長度最長也只有10,四個bits一組,用bitmask解題 ----- The maximum le...
5 則留言:
class B1
{
public static void main(String[] args)
{
int j=3;
float[] poly=new float[3];
poly[0]=1.4f;
poly[1]=2.3f;
poly[2]=3.7f;
for(int i=poly.length-1;i>=0;i--)
{
System.out.print(poly[i]+"X^"+(i+1)+"+");
if(i==0)
{System.out.print(poly[i]+"X^"+(i+1));}
}
System.out.println();
}
}
class ex
{
public static void main(String[] args)
{
int j=3;
float[] poly=new float[3];
poly[0]=1.4f;
poly[1]=2.3f;
poly[2]=3.7f;
for(int i=poly.length-1;i>=0;i--)
{
System.out.print(poly[i]+"X^"+(i+1)+"+");
if(i==0)
{System.out.print(poly[i]+"X^"+(i+1));}
}
System.out.println();
}
}
public class A2
{
public static void main(String[] args)
{
int j=3;
float[] poly=new float[3];
poly[0]=2.4f;
poly[1]=3.6f;
poly[2]=4.5f;
for(int i=poly.length-1; i>=0; i--)
{
System.out.print(poly[i]+"X^"+(i+1)+" + ");
if(i==0)
{
System.out.print(poly[i]+"X^"+(i+1));
}
}
System.out.println();
}
}
class A1
{
public static void main(String[] args)
{
int j=3;
float[] poly=new float[3];
poly[0]=1.4f;
poly[1]=2.3f;
poly[2]=3.7f;
for(int i=poly.length-1;i>=0;i--)
{
System.out.print(poly[i]+"X^"+(i+1)+"+");
if(i==0)
{System.out.print(poly[i]+"X^"+(i+1));}
}
System.out.println();
}
}
public class 12{
public static void main(String[] args)
{
int j=3;
float[] poly=new float[3];
poly[0]=2.4f;
poly[1]=3.6f;
poly[2]=4.5f;
for(int i=poly.length-1; i>=0; i--)
{
System.out.print(poly[i]+"X^"+(i+1)+" + ");
if(i==0)
{
System.out.print(poly[i]+"X^"+(i+1));
}
}
System.out.println();
}
}
張貼留言