python字符串不能直接比较,得加上cmp函数,相等返回0,大于返回1,小于返回-1,第一个字母相同会接着 下一个字母进行比较。 from sqlalchemy.util import cmp a = 'a' b = 'a' print(cmp(a,b))
#coding=utf-8
```
def calc_interval(a,b,c,d):
max_x = max(b,d)
min_x = min(a,c)
if max_x==b and min_x==a: return (c,d)
if min_x==c and max_x==d: return (a,b)
if max_x==b and min_x==c:
if c>a:
return (a,c)
elif c==a:
return (c,c)
else: return None
if max_x==d and min_x==a:
if b>c:
return (c,b)
elif b==c:
return (b,b)
else:
return None
answer = calc_interval(1,5,2,3) print(answer)
```
function jiaoji(arr1,arr2){ var newarr1 = []; var n = arr1[1]-arr1[0]; while(n >=0){ newarr1.push(arr1[0]++); n--; } var newarr2 = []; var m = arr2[1]-arr2[0]; while(m>=0){ newarr2.push(arr2[0]++); m--; } var result = []; newarr1.map(item=>{ if(newarr2.indexOf(item) >=0){ result.push(item) } }) return result; } jiaoji([2,7],[2,6]);
public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.println("请输入第一个区间的两端点:"); int a=scanner.nextInt(); int b=scanner.nextInt(); System.out.println("请输入第二个区间的两端点:"); int c=scanner.nextInt(); int d=scanner.nextInt(); int[] arr1 = new int[b - a + 1]; int[] arr2 = new int[d - c + 1]; arr1[0] = a; arr2[0] = c; for (int i = 1; i < arr1.length; i++) { arr1[i]=arr1[i-1]+1; } for (int i = 1; i < arr2.length; i++) { arr2[i]=arr2[i-1]+1; } intersection(arr1,arr2); } private static void intersection(int[] arr1,int[] arr2){ List<Integer> list = new LinkedList<>(); for (int i = 0; i < arr1.length; i++) { for (int j = 0; j < arr2.length; j++) { if (arr1[i]>=arr2[j]&&arr1[i]<=arr2[arr2.length-1]){ list.add(arr1[i]); break; } } } if (list.size()==0){ System.out.println("没有交集!"); }else { System.out.println("交集为:" + list.toString()); } }