发表于 | 分类于 | 阅读次数:
字数统计: 353 | 阅读时长 ≈ 2 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
from random import randrange


def to_b4(n):
    return [n/4**k%4 for k in range(5)]


def fr_b4(li):
    return sum([li[k]*4**k for k in range(5)])


def drink(p1,p2):
    li1,li2 = to_b4(p1),to_b4(p2)
    g0 = [li1[k]==0 or li2[k]==0 for k in range(5)]
    g1 = [li1[k]==1 or li2[k]==1 for k in range(5)]
    g2 = [li1[k]==2 or li2[k]==2 for k in range(5)]
    g3 = [li1[k]==3 or li2[k]==3 for k in range(5)]
    gc,gf = {},{}
    for i in range(4):
        for j in range(i+1,5):
            diff1 = abs(li1[i]-li1[j])
            diff2 = abs(li2[i]-li2[j])
            gc[i,j] = diff1 == 1 or diff2 == 1
            gf[i,j] = diff1 > 1 or diff2 > 1
    return g0,g1,g2,g3,gc,gf


def check(u,v,d1,d2,c,f):
    a = [[0,1,2,2],[1,0,1,2],[2,1,0,1],[2,2,1,0]]
    a11 = a[u][d1]
    a22 = a[v][d2]
    c1 = a11 == 1 or a22 == 1
    f1 = a11 == 2 or a22 == 2
    if c == c1 and f == f1:
        return u,v
    else:
        return v,u


def test(g0,g1,g2,g3,gc,gf):
    diff = 5
    t1,t2 = range(5),range(5)
    for k in range(4,-1,-1):
        li = [g0[k],g1[k],g2[k],g3[k]]
        u = li.index(True)
        if (li.count(True) == 1):
            t1[k],t2[k] = u,u
        else:
            li[u] = False
            v = li.index(True)
            if diff == 5:
                diff = k
                t1[k],t2[k] = u,v
            else:
                t1[k],t2[k] = check(u,v,t1[diff],t2[diff],gc[k,diff],gf[k,diff])
    return fr_b4(t1),fr_b4(t2)


poison1 = randrange(1024)
poison2 = (poison1 + randrange(1,1024)) % 1024
g0,g1,g2,g3,gc,gf = drink(poison1,poison2)
target1,target2 = test(g0,g1,g2,g3,gc,gf)


print poison1,poison2
print to_b4(poison1)
print to_b4(poison2)
print "0:",g0
print "1:",g1
print "2:",g2
print "3:",g3
print "c:",gc
print "f:",gf
print target1,target2

发表于 | 分类于 | 阅读次数:
字数统计: 222 | 阅读时长 ≈ 1 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

from random import randrange


def to_b2(n):
    return [n / 2**k % 2 for k in range(10)]


def fr_b2(li):
    return sum([li[k] * 2**k for k in range(10)])


def drink(p1, p2):
    li1, li2 = to_b2(p1), to_b2(p2)
    g0 = [li1[k] == 0 or li2[k] == 0 for k in range(10)]
    g1 = [li1[k] == 1 or li2[k] == 1 for k in range(10)]
    gd = {}
    for i in range(9):
        for j in range(i + 1, 10):
            gd[i, j] = li1[i] != li1[j] or li2[i] != li2[j]
    return g0, g1, gd


def test(g0, g1, gd):
    diff = 10
    t1, t2 = range(10), range(10)
    for k in range(9, -1, -1):
        if not g0[k]:
            t1[k], t2[k] = 1, 1
        elif not g1[k]:
            t1[k], t2[k] = 0, 0
        elif diff == 10:
            diff = k
            t1[k], t2[k] = 0, 1
        elif gd[k, diff]:
            t1[k], t2[k] = 1, 0
        else:
            t1[k], t2[k] = 0, 1
    return fr_b2(t1), fr_b2(t2)


if __name__ == "__main__":
    poison1 = randrange(1024)
    poison2 = (poison1 + randrange(1, 1024)) % 1024
    g0, g1, gd = drink(poison1, poison2)
    target1, target2 = test(g0, g1, gd)

    print(poison1, poison2)
    print(to_b2(poison1))
    print(to_b2(poison2))
    print("0:", g0)
    print("1:", g1)
    print("d:", gd)
    print(target1, target2)

发表于 | 阅读次数:
字数统计: 402 | 阅读时长 ≈ 2 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
给定一个仅包含整数，且按照大小顺序排好序的列表，列表内不存在重复的整数。
实现一个函数，将列表格式化为由`,`(逗号)分隔的字符串；如果相邻的整数(至少3个)是
连续的(值相差1为连续)，则将这几个相邻的整数格式化为由`-`(减号)分隔、左右分别为
起始和终止位整数的字符串。

示例：
func([-6,-3,-2,-1,0,1,3,4,5,7,8,9,10,11,14,15,17,18,19,20])  -->  '-6,-3-1,3-5,7-11,14,15,17-20'
func([-3,-2,-1,2,10,15,16,18,19,20])  -->  '-3--1,2,10,15,16,18-20'

特殊情况示例：
func([])  -->  ''
"""

import unittest
from itertools import groupby


def func(lst):
    # your code
    sum = sub_arr(lst)
    return ','.join(sum)


def sub_arr(lst):
    fun = lambda x: x[1] - x[0]
    sum = []
    for k, g in groupby(enumerate(lst), fun):
        s = [v for i, v in g]
#        print(s)
        if len(s) <= 1:
            sum.append(str(s[0]))
        elif len(s) == 2:
            sum.append(str(s[0]))
            sum.append(str(s[1]))
        else:
            target = [str(s[0]), str(s[-1])]
            n = '-'.join(target)
            sum.append(n)

    return sum


class DefaultTestCase(unittest.TestCase):

    def test_func(self):
        self.assertEqual(func([-6,-3,-2,-1,0,1,3,4,5,7,8,9,10,11,14,15,17,18,19,20]), '-6,-3-1,3-5,7-11,14,15,17-20')
        self.assertEqual(func([-3,-2,-1,2,10,15,16,18,19,20]), '-3--1,2,10,15,16,18-20')
        self.assertEqual(func([]), '')
        self.assertEqual(func([-6,-4,-2,0,2,4,6]), '-6,-4,-2,0,2,4,6')
        self.assertEqual(func([-6,-5,-3,-2,0,1,3,4,6]), '-6,-5,-3,-2,0,1,3,4,6')

if __name__ == '__main__':
    unittest.main()

发表于 | 阅读次数:
字数统计: 453 | 阅读时长 ≈ 2 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103

#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
    你需要实现一个转换器，将一个正整数在不同的进制(通用的/自定义的)之间转换。
    后面有一些预定义的进制及其字符集。
    
    示例：
    func("15", dec_chr, bin_chr)       -->  "1111"
    func("15", dec_chr, oct_chr)       -->  "17"
    func("1010", bin_chr, dec_chr)     -->  "10"
    func("1010", bin_chr, hex_chr)     -->  "a"
    func("0", dec_chr, alpha_chr)      --> "a"
    func("27", dec_chr, allow_chr)     --> "bb"
    func("hello", allow_chr, hex_chr)  --> "320048"
"""

import unittest


bin_chr      = '01'
oct_chr      = '01234567'
dec_chr      = '0123456789'
hex_chr      = '0123456789abcdef'
allow_chr    = 'abcdefghijklmnopqrstuvwxyz'
allup_chr    = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alpha_chr    = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
alphanum_chr = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'


def func(input, source, target):
    """
    二进制 八进制 十进制 十六进制
    小写（26） 大写（26） 字母（52） 字母和数字（62）
    辗转相除
    """
    # your code
    #    oct()
    #    hex()
    #    bin()
    if len(target) != len(source):
        transfer = input2dec(input, source)
    #    print(transfer)
        get_re = dec2target(transfer, target)
        print(get_re)
    
    else:
        if target.startswith("A"):
            get_re = input.upper()
        if target.startswith("a"):
            get_re = input.lower()
    
    return get_re


def input2dec(input, source):
    get_power = len(source)
    get_sum = 0
    s = [i for i in input]
    s.reverse()
    for index, i in enumerate(s):
        num = source.find(i)
        get_value = num * (get_power**index)
        get_sum += get_value

    return get_sum


def dec2target(n, target):
    b=[]
    x = len(target)
    while True:
        s=n//x    #商
        y=n%x     #余数
        b=b+[y]
        if s==0:
            break
        n=s
    b.reverse()
    s = ''
    a = [i for i in target]
    for i in b:
#        print(a[i], end='')
        s += a[i]
    return s


class DefaultTestCase(unittest.TestCase):
    
    def test_func(self):
        self.assertEqual(func("15", dec_chr, bin_chr), "1111")
        self.assertEqual(func("15", dec_chr, oct_chr), "17")
        self.assertEqual(func("1010", bin_chr, dec_chr), "10")
        self.assertEqual(func("1010", bin_chr, hex_chr), "a")
        self.assertEqual(func("0", dec_chr, alpha_chr), "a")
        self.assertEqual(func("27", dec_chr, allow_chr), "bb")
        self.assertEqual(func("hello", allow_chr, hex_chr), "320048")
        self.assertEqual(func("SAME", allup_chr, allup_chr), "SAME")
        self.assertEqual(func("WORLD", allup_chr, alphanum_chr), 'Hgrz')


if __name__ == '__main__':
    unittest.main()

发表于 | 阅读次数:
字数统计: 228 | 阅读时长 ≈ 1 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
from dataclasses import dataclass
from queue import PriorityQueue

@dataclass
class Edge:
    start_id: int
    end_id: int
    weight: int

@dataclass(order=True)
class Vertex:
    distance_to_start = float("inf")
    vertex_id: int

class Graph:
    def __init__(self, num_vertices: int):
        self._num_vertices = num_vertices
        self._adjacency = [[] for _ in range(num_vertices)]
    
    def add_edge(self, from_vertex: int, to_vertex: int, weight: int) -> None:
        self._adjacency[from_vertex].append(Edge(from_vertex, to_vertex, weight))

    def dijkstra(self, from_vertex: int, to_vertex: int) -> None:
        vertices = [Vertex(i) for i in range(self._num_vertices)]
        vertices[from_vertex].distance_to_start = 0
        visited = [False] * self._num_vertices
        predecessor = [-1] * self._num_vertices
        q = PriorityQueue()
        q.put(vertices[from_vertex])
        visited[from_vertex] = True
        while not q.empty():
            min_vertex = q.get()
            if min_vertex.vertex_id == to_vertex:
                break
            for edge in self._adjacency[min_vertex.vertex_id]:
                next_vertex = vertices[edge.end_id]
                if min_vertex.distance_to_start + edge.weight < next_vertex.distance_to_start:
                    next_vertex.distance_to_start = min_vertex.distance_to_start + edge.weight
                    predecessor[next_vertex.vertex_id] = min_vertex.vertex_id
                    if not visited[next_vertex.vertex_id]:
                        q.put(next_vertex)
                        visited[next_vertex.vertex_id] = True
            
        path = lambda x: path(predecessor[x]) + [str(x)] if from_vertex != x else [str(from_vertex)]
        print("->".join(path(to_vertex)))


if __name__ == "__main__":
    graph = Graph(6)
    graph.add_edge(0, 1, 10)
    graph.add_edge(0, 4, 15)
    graph.add_edge(1, 2, 15)
    graph.add_edge(1, 3, 2)
    graph.add_edge(2, 5, 5)
    graph.add_edge(3, 2, 1)
    graph.add_edge(3, 5, 12)
    graph.add_edge(4, 5, 10)
    graph.dijkstra(0, 5)