arr=[]
print("输入1-9数字,空格分开")
n =input().split(" ")
for i in n:
for j in n:
for k in n:
if i!=j and i!=k and j!=k:
num=i + j +k
arr.append(num)
print(arr)
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return&
在JDK1.5之前的单例实现方式有两种(懒汉式和饿汉式并无设计上的区别故看做一种),两者同是私有构
造器,导出静态成员变量,以便调用者访问。
第一种
package singleton;
public class Singleton {
//导出全局成员
public final static Singleton INSTANCE = new S